Cycles in 2-connected graphs

DOI10.1016/j.jctb.2004.09.003zbMath1057.05048OpenAlexW1993134726MaRDI QIDQ705891

Pei Wang, Geng-Hua 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

zbMATH Keywords

cyclesextremal graphs2-connected graphs

Mathematics Subject Classification ID

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

Related Items (10)

Ordering \(Q\)-indices of graphs: given size and circumference ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ The Number of Cliques in Graphs Covered by Long Cycles ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ The codiameter of a 2-connected graph ⋮ Cycles and stability ⋮ Graphs with almost all edges in long cycles ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ Spectral radius and Hamiltonian properties of graphs ⋮ Stability results on the circumference of a graph

Cites Work

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

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