On the diameter of a graph
From MaRDI portal
Cited in
(28)- Diameter of 4-colourable graphs
- Regular separable graphs of minimum order with given diameter
- Graphs of maximum diameter
- 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
- Solution of two-classes of Diophantine equations with 2-quasiperiodic functions
- Formally verified algorithms for upper-bounding state space diameters
- The diameter of directed graphs
- Existence of a spanning tree having small diameter
- Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza
- Randomized construction of complexes with large diameter
- Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians
- Diameter, edge-connectivity, and \(C_4\)-freeness
- Lower bounds for the capture time: linear, quadratic, and beyond
- Vertex-critical graphs of given diameter
- Minimum orders of Eulerian oriented digraphs with given diameter
- APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
- DIAMETER OF THE DIRECT PRODUCT OF WIELANDT GRAPH
- Maximum diameter of 3‐ and 4‐colorable graphs
- Turán‐type problems for long cycles in random and pseudo‐random graphs
- Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures
- A diameter bound for 4-edge-connected C₄-free graphs
- AI Planning Languages Semantics
- Verified SAT-Based AI Planning
- Upper Bounding Diameters of State Spaces of Factored Transition Systems
- On the maximum diameter of \(k\)-colorable graphs
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
- Diameter and maximum degree in Eulerian digraphs
This page was built for publication: On the diameter of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396003)
