On the diameter of a graph
From MaRDI portal
Publication:2396003
DOI10.1307/mmj/1028999370zbMath0134.19603OpenAlexW2024616953MaRDI QIDQ2396003
Publication date: 1965
Published in: Michigan Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1307/mmj/1028999370
Related Items (23)
On the maximum diameter of \(k\)-colorable graphs ⋮ DIAMETER OF THE DIRECT PRODUCT OF WIELANDT GRAPH ⋮ An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ Formally verified algorithms for upper-bounding state space diameters ⋮ Maximum diameter of 3‐ and 4‐colorable graphs ⋮ Regular separable graphs of minimum order with given diameter ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Diameter, edge-connectivity, and \(C_4\)-freeness ⋮ Diameter and maximum degree in Eulerian digraphs ⋮ Minimum orders of Eulerian oriented digraphs with given diameter ⋮ Existence of a spanning tree having small diameter ⋮ Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza ⋮ Graphs of maximum diameter ⋮ Vertex-critical graphs of given diameter ⋮ The diameter of directed graphs ⋮ Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs ⋮ Upper and lower bounds for graph-diameter problems with application to Record allocation ⋮ Randomized construction of complexes with large diameter ⋮ Diameter of 4-colourable graphs ⋮ Solution of two-classes of Diophantine equations with 2-quasiperiodic functions ⋮ APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION ⋮ Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians
This page was built for publication: On the diameter of a graph
