Hamilton cycles in regular 2-connected graphs
From MaRDI portal
Publication:1246545
DOI10.1016/0095-8956(80)90042-8zbMATH Open0377.05027OpenAlexW1993348640MaRDI QIDQ1246545FDOQ1246545
Authors: Bill Jackson
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90042-8
Cites Work
Cited In (38)
- Long path connectivity of regular graphs
- On regular 2-connected 2-path Hamiltonian graphs
- Longest cycles in regular 2-connected claw-free graphs
- The robust component structure of dense regular graphs and applications
- Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
- Hamiltonian uniform subset graphs
- Hamilton cycles in dense regular digraphs and oriented graphs
- Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups
- 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
- Circuits through specified edges
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Claw-free graphs---a survey
- The antipodal layers problem
- Non-separating 2-factors of an even-regular graph
- On Hamiltonicity of regular graphs with bounded second neighborhoods
- Additive patterns in multiplicative subgroups
- Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
- On Hamiltonian-connected regular graphs
- Almost all Cayley graphs are hamiltonian
- Length of cycles in generalized Petersen graphs
- A survey on Hamilton cycles in directed graphs
- The ubiquitous Petersen graph
- Hamiltonicity in connected regular graphs
- Hamilton-connected derangement graphs on \(S_ n\)
- Longest cycles in regular graphs
- On the Structure of Non-Hamiltonian Graphs I
- Edge-Hamiltonian property in regular 2-connected graphs
- Dominating cycles in regular 3-connected graphs
- Hamilton cycles in regular 3-connected graphs
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
- Weakly bipancyclic bipartite graphs
- Neighborhood conditions and edge-disjoint perfect matchings
- On a generalization of Chvátal's condition giving new Hamiltonian degree sequences
- Resolving the Hamiltonian problem for vertex-transitive graphs of order a product of two primes
- Hamiltonian cycles and tight cutsets
- On the circumferences of regular 2-connected graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
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)