Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
type: Item
instance of: scholarly article
title: Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
zbMATH Open document ID: 0366.05037
DOI: 10.1016/0095-8956(80)90065-9
author: Victor Klee
published in: Journal of Combinatorial Theory. Series B
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3570492
zbMATH Keywords: (d,c,v)-graph
zbMATH Keywords: diameter
zbMATH Keywords: connectivity
zbMATH Keywords: valence
zbMATH Keywords: enumeration
MaRDI profile type: Publication
full work available at URL: 0095-8956(80)90065-9
OpenAlex ID: W1984265784
cites work: Q5682013
cites work: Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs
cites work: Minimum graphs of specified diameter, connectivity and valence. II
cites work: Q5616724
cites work: The Klee and Quaife minimum (d, 1, 3)-graphs revisited
cites work: The minimum-order three-connected cubic graphs with specified diameters
cites work: Regular separable graphs of minimum order with given diameter
description: scientific article; zbMATH DE number 3570492