Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes

DOI10.1016/S0304-0208(08)73366-8zbMath0525.05036MaRDI QIDQ3039386

Denise Amar, Anne Germa, Irene Fournier

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

diameterminimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (10)

On the maximum diameter of \(k\)-colorable graphs ⋮ Distances in graphs of girth 6 and generalised cages ⋮ Maximum diameter of 3‐ and 4‐colorable graphs ⋮ Diameter, edge-connectivity, and \(C_4\)-freeness ⋮ Diameter and maximum degree in Eulerian digraphs ⋮ Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza ⋮ Graphs of maximum diameter ⋮ Radius, diameter, and minimum degree ⋮ Minimum graphs of specified diameter, connectivity and valence. II ⋮ Diameter of 4-colourable graphs

This page was built for publication: Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes