On diameter 2-critical graphs

DOI10.1016/0012-365X(87)90174-9MaRDI QIDQ1096642zbMATH OpenFDO

Authors Genghua Fan

Publication date 1987

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graphsizeboundnumber of edgesdiameter 2-critical

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Recommendations

• On a conjecture of Murty and Simon on diameter 2-critical graphs
• On a conjecture of Murty and Simon on diameter two critical graphs. II.
• A maximum degree theorem for diameter-2-critical graphs
• scientific article; zbMATH DE number 3908467
• Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey

Cites work

• scientific article; zbMATH DE number 3908467 (Why is no real title available?)
• scientific article; zbMATH DE number 3497930 (Why is no real title available?)
• On diameter critical graphs

Cited in

(33)

• The minimum number of edges in a vertex diameter-2-critical graph
• scientific article; zbMATH DE number 1222089 (Why is no real title available?)
• Total domination edge critical graphs with total domination number three and many dominating pairs
• SAT modulo symmetries for graph generation and enumeration
• Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
• Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
• scientific article; zbMATH DE number 841588 (Why is no real title available?)
• All my favorite conjectures are critical
• On a conjecture of Murty and Simon on diameter two critical graphs. II.
• scientific article; zbMATH DE number 1191010 (Why is no real title available?)
• scientific article; zbMATH DE number 3788665 (Why is no real title available?)
• A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
• On a conjecture on the diameter of line graphs of graphs of diameter two
• Primitive diameter 2-critical graphs
• Diameter critical graphs
• A maximum degree theorem for diameter-2-critical graphs
• On a conjecture of Murty and Simon on diameter 2-critical graphs
• A characterization of diameter-2-critical graphs whose complements are diamond-free
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Extremal graphs domination insensitive to the removal of \(k\) edges
• scientific article; zbMATH DE number 3908467 (Why is no real title available?)
• The maximum number of edges in a minimal graph of diameter 2
• A characterization of diameter-2-critical graphs with no antihole of length four
• Constructing goal-minimally \(k\)-diametric graphs by lifts
• Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza
• Size in maximal triangle-free graphs and minimal graphs of diameter 2
• Perfect matchings in total domination critical graphs
• On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs
• Concerning the number of edges in a graph with diameter constraints
• scientific article; zbMATH DE number 540106 (Why is no real title available?)
• Properties of total domination edge-critical graphs
• Minimum vertex‐diameter‐2‐critical graphs
• A characterization of \(P_5\)-free, diameter-2-critical graphs

This page was built for publication: On diameter 2-critical graphs

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