Classification and enumeration of minimum (d, 3, 3)-graphs for odd d

DOI10.1016/0095-8956(80)90065-9zbMath0366.05037OpenAlexW1984265784MaRDI QIDQ1241756

Victor Klee

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90065-9

zbMATH Keywords

diameterenumerationconnectivityvalence(d,c,v)-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (8)

Unnamed Item ⋮ Regular separable graphs of minimum order with given diameter ⋮ The maximum radius of graphs with given order and minimum degree ⋮ Minimum orders of Eulerian oriented digraphs with given diameter ⋮ Decomposition of 3-connected cubic graphs ⋮ Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs ⋮ Minimum graphs of specified diameter, connectivity and valence. II ⋮ APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION

Cites Work

• Unnamed Item
• Unnamed Item
• Regular separable graphs of minimum order with given diameter
• Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs
• Minimum graphs of specified diameter, connectivity and valence. II
• The Klee and Quaife minimum (d, 1, 3)-graphs revisited
• The minimum-order three-connected cubic graphs with specified diameters

This page was built for publication: Classification and enumeration of minimum (d, 3, 3)-graphs for odd d