Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs

DOI10.1016/J.DISC.2017.10.033MaRDI QIDQ1744769zbMATH OpenOpenAlexFDO

Authors Zdeněk Ryjáček, Petr Vrána, Liming Xiong

Publication date 19 April 2018

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2017.10.033

zbMATH Keywords

circumferenceclaw-freedegree conditionforbidden subgraphHamilton-connectedHamiltonianhourglass-free

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
• Hamiltonicity in 3-connected claw-free graphs
• On Hamiltonicity of 3-connected claw-free graphs
• Hamiltonicity of 3-connected quasi-claw-free graphs.
• Hamiltonian cycles in 3‐connected claw‐free graphs
• Hamiltonian cycles in 3-connected claw-free graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
• Hamilton cycles in 3-connected claw-free and net-free graphs
• scientific article; zbMATH DE number 1293866

Cites work

• 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
• A closure for 1-Hamilton-connectedness in claw-free graphs
• A nine vertex theorem for 3-connected claw- free graphs
• A twelve vertex theorem for 3-connected claw-free graphs
• Circumferences and minimum degrees in 3-connected claw-free graphs
• Claw-free 3-connectedP11-free graphs are hamiltonian
• Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
• Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• Forbidden subgraphs, stability and hamiltonicity
• Graph theory
• Hamilton cycles in 3-connected claw-free and net-free graphs
• Hamiltonian claw-free graphs involving minimum degrees
• Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• On 1-Hamilton-connected claw-free graphs
• On a closure concept in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On factors of 4-connected claw-free graphs
• Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs

Cited in

(10)

• Forbidden pairs for equality of connectivity and edge-connectivity of graphs
• On Hamiltonicity of 2-connected claw-free graphs
• A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
• The local structure of claw-free graphs without induced generalized bulls
• Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
• Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
• Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
• Hamilton-connected claw-free graphs with small parameters
• Exploring Hamilton-connectedness in \(\{K_{1, 3}, \Gamma_0, P_{18} \}\)-free graphs
• Every 4-connected \{claw, hourglass\}-free graph is 2-Hamiltonian

This page was built for publication: Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744769)