Diameter, edge-connectivity, and \(C_4\)-freeness

DOI10.1016/j.disc.2023.113318OpenAlexW4318833114MaRDI QIDQ2689491

Dieter Rautenbach, Vanessa Hiebeler, Johannes Pardey

Publication date: 10 March 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.08805

zbMATH Keywords

diameteredge-connectivity\(C_4\)-freenessBrown graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (1)

Edge-fault diameter of \(C_4\)-free graphs

Cites Work

• Unnamed Item
• On size, order, diameter and edge-connectivity of graphs
• On the maximum diameter of \(k\)-colorable graphs
• An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph
• An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
• Radius, diameter, and minimum degree
• Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza
• Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree
• Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
• Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs
• On the diameter of a graph
• Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
• Polarity graphs revisited
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: Diameter, edge-connectivity, and \(C_4\)-freeness