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

DOI10.1016/0095-8956(77)90059-4zbMATH Open0378.05044OpenAlexW2041976722MaRDI QIDQ1246437FDOQ1246437

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)

• Title not available (Why is that?)
• Regular separable graphs of minimum order with given diameter
• Minimum orders of Eulerian oriented digraphs with given diameter
• APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
• Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
• The maximum radius of graphs with given order and minimum degree
• Minimum graphs of specified diameter, connectivity and valence. II

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)