The codiameter of a 2-connected graph

DOI10.1016/j.disc.2007.03.036zbMath1133.05050OpenAlexW2038695259MaRDI QIDQ2463471

Pei Wang, Xue-Zheng Lv

Publication date: 12 December 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.036

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (2)

The Number of Cliques in Graphs Covered by Long Cycles ⋮ Graphs with almost all edges in long cycles

Cites Work

• Cycles in 2-connected graphs
• Long cycles and the codiameter of a graph. I
• Maximal cycles in graphs
• Subgraph coverings and edge switchings
• On maximal paths and circuits of graphs
• Maximal circuits of graphs. I

This page was built for publication: The codiameter of a 2-connected graph