On the circumference of 3-connected quasi-claw-free graphs

DOI10.1007/S00373-006-0650-7zbMATH Open1098.05045OpenAlexW2003802937MaRDI QIDQ2502034FDOQ2502034

Vumar Elkin

Publication date: 12 September 2006

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0650-7

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Hamiltonian cycles in 3‐connected claw‐free graphs
• Quasi-claw-free graphs
• Hamiltonicity of 2-connected quasi-claw-free graphs
• Hamiltonicity of 3-connected quasi-claw-free graphs.
• Longest paths joining given vertices in a graph

Cited In (6)

• Circumferences of 3-connected claw-free graphs
• Circumferences and minimum degrees in 3-connected claw-free graphs
• Title not available (Why is that?)
• Vertex pancyclicity in quasi-claw-free graphs
• Circumferences of 3-connected claw-free graphs. II.
• On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs

This page was built for publication: On the circumference of 3-connected quasi-claw-free graphs

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