A characterization of 2-connected \ K₁ , 3 , N₃ , 1 , 1 \-free non-Hamiltonian graphs

DOI10.1016/J.DISC.2021.112321zbMATH Open1460.05105OpenAlexW3128902974MaRDI QIDQ2659232FDOQ2659232

Authors: Shuya Chiba, Michitaka Furuya 

Publication date: 25 March 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

Recommendations

• Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
• Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
• scientific article; zbMATH DE number 1281388
• Hamiltonian circuits in N₂‐locally connected K_1,3‐free graphs
• Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs

zbMATH Keywords

Hamiltonian cycleclaw-free graphclosuregeneralized net

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On a closure concept in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Minimal \(2\)-connected non-Hamiltonian claw-free graphs
• Forbidden subgraphs that imply 2-factors
• Graph Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Closure, 2-factors, and cycle coverings in claw-free graphs

Cited In (3)

• Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
• 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
• Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs

This page was built for publication: A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs

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