Article
Licensed
Unlicensed
Requires Authentication
Construction of maximally non-Hamiltonian graphs
-
P. V. Roldugin
Published/Copyright:
July 1, 2003
In this paper we study the maximally non-Hamiltonian graphs (MNH graphs), that is, the graphs whose property to be non-Hamiltonian ceases to exist as soon as an edge is added. We give rules how to construct MNH graphs which make it possible, starting from MNH graphs with some properties, to get MNH graphs of greater order.
Published Online: 2003-07-01
Published in Print: 2003-07-01
Copyright 2003, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain
Articles in the same Issue
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain
