Dominating cycles in regular 3-connected graphs
From MaRDI portal
Publication:1193714
DOI10.1016/0012-365X(92)90051-GzbMath0756.05075OpenAlexW1983571890MaRDI QIDQ1193714
Bill Jackson, Yung-ching Chu, Hao Li
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90051-g
Related Items
Cycle partitions of regular graphs, Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs, Hamiltonicity of 2-connected claw-center independent graphs, Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs, A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs, The robust component structure of dense regular graphs and applications, Hamiltonicity in 2-connected graphs with claws, Hamiltonian cycles in regular 3-connected claw-free graphs, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, Circumference of a regular graph, Hamilton cycles in dense regular digraphs and oriented graphs, Circumferences of regular claw-free graphs, Hamilton cycles in regular 3-connected graphs, Hamiltonian cycles in 3‐connected claw‐free graphs
Cites Work
