Minimum vertex‐diameter‐2‐critical graphs

DOI10.1002/jgt.20111zbMath1076.05045OpenAlexW4231152348MaRDI QIDQ5711697

Ya-Chen Chen, Zoltan Fueredi

Publication date: 8 December 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20111

zbMATH Keywords

extremal graphsvulnerability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (6)

A maximum degree theorem for diameter-2-critical graphs ⋮ A characterization of diameter-2-critical graphs with no antihole of length four ⋮ Diameter critical graphs ⋮ A characterization of diameter-2-critical graphs whose complements are diamond-free ⋮ A characterization of \(P_5\)-free, diameter-2-critical graphs ⋮ Total domination edge critical graphs with total domination number three and many dominating pairs

Cites Work

• Unnamed Item

This page was built for publication: Minimum vertex‐diameter‐2‐critical graphs