Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs

DOI10.1016/0095-8956(77)90059-4MaRDI QIDQ1246437zbMATH OpenOpenAlexFDO

Authors Victor Klee, Howard Quaife

Publication date 1977

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(77)90059-4

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99)

Cites work

• Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
• Minimum graphs of specified diameter, connectivity and valence. II
• On the diameter of a graph

Cited in

(7)

• Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
• The maximum radius of graphs with given order and minimum degree
• APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
• Minimum graphs of specified diameter, connectivity and valence. II
• Regular separable graphs of minimum order with given diameter
• scientific article; zbMATH DE number 7488135 (Why is no real title available?)
• Minimum orders of Eulerian oriented digraphs with given diameter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1246437)