Hamilton cycles in regular 2-connected graphs
From MaRDI portal
Publication:1246545
Cites work
Cited in
(45)- Longest cycles in regular graphs
- Hamiltonian uniform subset graphs
- Circuits through specified edges
- Neighborhood conditions and edge-disjoint perfect matchings
- Long path connectivity of regular graphs
- Dominating cycles in regular 3-connected graphs
- The ubiquitous Petersen graph
- Hamilton cycles in regular 3-connected graphs
- Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
- On the circumferences of regular 2-connected graphs
- The antipodal layers problem
- Hamilton-connected derangement graphs on \(S_ n\)
- Longest cycles in regular 2-connected claw-free graphs
- Claw-free graphs---a survey
- On a generalization of Chvátal's condition giving new Hamiltonian degree sequences
- On Hamiltonicity of regular graphs with bounded second neighborhoods
- Resolving the Hamiltonian problem for vertex-transitive graphs of order a product of two primes
- Hamiltonicity in connected regular graphs
- Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Additive patterns in multiplicative subgroups
- The robust component structure of dense regular graphs and applications
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
- On Hamiltonian-connected regular graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- A survey on Hamilton cycles in directed graphs
- On the Structure of Non-Hamiltonian Graphs I
- Almost all Cayley graphs are hamiltonian
- Weakly bipancyclic bipartite graphs
- Hamilton cycles in primitive vertex-transitive graphs of order a product of two primes -- the case \(\mathrm{PSL}(2,q^2)\) acting on cosets of \(\mathrm{PGL}(2, q)\)
- A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
- On regular 2-connected 2-path Hamiltonian graphs
- Hamilton cycles in dense regular digraphs and oriented graphs
- Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
- Length of cycles in generalized Petersen graphs
- Hamiltonian cycles and tight cutsets
- Ore-type conditions for existence of a jellyfish in a graph
- Longest cycles in vertex-transitive and highly connected graphs
- An ILP approach to determine smallest 4-regular non-Hamiltonian, nontraceable, and nonhomogeneously traceable graphs
- Hamilton cycles in vertex-transitive graphs of order 6 p
- On regular 2-path Hamiltonian graphs
- Hamiltonicity of certain vertex-transitive graphs revisited
- Geometric parameters of bipartite suspensions
- Edge-Hamiltonian property in regular 2-connected graphs
- Non-separating 2-factors of an even-regular graph
This page was built for publication: Hamilton cycles in regular 2-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1246545)