Minimum vertex‐diameter‐2‐critical graphs

DOI10.1002/JGT.20111zbMATH Open1076.05045OpenAlexW4231152348MaRDI QIDQ5711697FDOQ5711697

Authors: Ya-Chen Chen, Zoltán Füredi 

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

Recommendations

• The minimum number of edges in a vertex diameter-2-critical graph
• Maximal and minimal vertex-critical graphs of diameter two
• On vertex critical graphs with prescribed diameter
• On diameter 2-critical graphs
• scientific article; zbMATH DE number 4097422

zbMATH Keywords

extremal graphsvulnerability

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (9)

• A maximum degree theorem for diameter-2-critical graphs
• A characterization of diameter-2-critical graphs with no antihole of length four
• A characterization of \(P_5\)-free, diameter-2-critical graphs
• Title not available (Why is that?)
• A characterization of diameter-2-critical graphs whose complements are diamond-free
• SAT modulo symmetries for graph generation and enumeration
• Total domination edge critical graphs with total domination number three and many dominating pairs
• Diameter critical graphs
• Minimum edge cuts in diameter 2 graphs

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

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