Dominating cycles in bipartite biclaw-free graphs

DOI10.1016/0012-365X(94)00153-6zbMath0839.05064OpenAlexW1986731883MaRDI QIDQ1903714

Oscar Ordaz, Hao Li, Evelyne Flandrin, Daniel Barraez

Publication date: 5 June 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00153-6

zbMATH Keywords

bipartite graphlongest cyclestardominating cyclebiclaw

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Hamiltonicity of bipartite biclaw-free graphs ⋮ Claw-free graphs---a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonicity of bipartite biclaw-free graphs
• Hamiltonian results inK1,3-free graphs
• Longest paths and cycles in K1,3-free graphs
• Hamilton cycles in claw-free graphs