Diameter, edge-connectivity, and C₄-freeness
From MaRDI portal
Publication:2689491
Recommendations
Cites work
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
- An upper bound on the radius of a 3-vertex-connected C₄-free graph
- Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza
- scientific article; zbMATH DE number 3763971 (Why is no real title available?)
- On Graphs that do not Contain a Thomsen Graph
- On size, order, diameter and edge-connectivity of graphs
- On the diameter of a graph
- On the maximum diameter of \(k\)-colorable graphs
- Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
- Polarity graphs revisited
- Proximity and remoteness in triangle-free and C₄-free graphs in terms of order and minimum degree
- Radius, diameter, and minimum degree
- Upper bounds on the average eccentricity of K₃-free and C₄-free graphs
- Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
Cited in
(10)- Vulnerability in graphs of diameter four
- A diameter bound for extensions of the \(F_{4}\)(2)-building
- On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs
- On the connectivity of diamond-free graphs
- Diameter and connectivity of (D; g)-cages
- On the edge-connectivity of C₄-free graphs
- Edge-fault diameter of C₄-free graphs
- Diameter, edge-connectivity, and C₄-freeness
- A diameter bound for 4-edge-connected C₄-free graphs
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
This page was built for publication: Diameter, edge-connectivity, and \(C_4\)-freeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689491)
