Cycles in 2-connected graphs

DOI10.1016/J.JCTB.2004.09.003zbMATH Open1057.05048OpenAlexW1993134726MaRDI QIDQ705891FDOQ705891

Authors: Pei Wang, Genghua Fan, Xue-Zheng Lv 

Publication date: 16 February 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.09.003

Recommendations

• On a conjecture of Woodall
• scientific article; zbMATH DE number 147638
• scientific article; zbMATH DE number 3914359
• A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
• scientific article; zbMATH DE number 3908470

zbMATH Keywords

cyclesextremal graphs2-connected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• On maximal paths and circuits of graphs
• Maximal cycles in graphs
• Maximal circuits of graphs. I
• Subgraph coverings and edge switchings
• Sufficient Conditions for Circuits in Graphs^†

Cited In (20)

• Graphs with cyclomatic number two having panconnected square
• Title not available (Why is that?)
• Stability of Woodall's theorem and spectral conditions for large cycles
• On a conjecture of Woodall
• Graphs with almost all edges in long cycles
• Vertex-dominating cycles in 2-connected bipartite graphs
• The codiameter of a 2-connected graph
• The Number of Cliques in Graphs Covered by Long Cycles
• Title not available (Why is that?)
• The maximum number of cliques in graphs with prescribed order, circumference and minimum degree
• The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number
• Cycles and stability
• How connectivity affects the extremal number of trees
• Stability results on the circumference of a graph
• Cycles of length 2 modulo 3 in graphs
• Title not available (Why is that?)
• 2-Walk linear graphs with small number of cycles
• Spectral radius and Hamiltonian properties of graphs
• Extensions of the Erdős-Gallai theorem and Luo's theorem
• Ordering \(Q\)-indices of graphs: given size and circumference

This page was built for publication: Cycles in 2-connected graphs

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