Cycles in triangle-free graphs

DOI10.1142/S1793830911001267MaRDI QIDQ2890991zbMATH OpenFDO

Authors Xiaojuan Li, Bing Wei, Yongjin Zhu

Publication date 12 June 2012

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830911001267

zbMATH Keywords

cyclesindependence numbertriangle-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The Chvátal-Erdös condition for cycles in triangle-free graphs
• Dominating cycles in triangle-free graphs.
• Cycles in triangle-free graphs of large chromatic number
• scientific article; zbMATH DE number 970792
• Cycles through specified vertices in triangle-free graphs

Cites work

• A note on Hamiltonian circuits
• Graph theory with applications
• Pancyclism in Chvátal-Erdős' graphs
• The Chvátal-Erdös condition for cycles in triangle-free graphs

Cited in

(7)

• Triangle-free strongly circular-perfect graphs
• Cycles in triangle-free graphs of large chromatic number
• The Chvátal-Erdös condition for cycles in triangle-free graphs
• Modification of CZ₃-free condition to have a cycle containing specified vertices
• Graphs omitting a finite set of cycles
• Cycles through specified vertices in triangle-free graphs
• scientific article; zbMATH DE number 970792 (Why is no real title available?)

This page was built for publication: Cycles in triangle-free graphs

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