The codiameter of a 2-connected graph

DOI10.1016/J.DISC.2007.03.036zbMATH Open1133.05050OpenAlexW2038695259MaRDI QIDQ2463471FDOQ2463471

Authors: 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

Recommendations

• Publication:3204491
• scientific article; zbMATH DE number 147649
• The smallest number of edges in a 2-connected graph with specified diameter
• scientific article; zbMATH DE number 1556731
• Codiameters of 3-connected 3-domination critical graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) 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
• Long cycles and the codiameter of a graph. I
• Cycles in 2-connected graphs

Cited In (7)

• Title not available (Why is that?)
• Long cycles and the codiameter of a graph. I
• Title not available (Why is that?)
• Graphs with almost all edges in long cycles
• Title not available (Why is that?)
• The Number of Cliques in Graphs Covered by Long Cycles
• A localized approach for Turán number of long cycles

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

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