The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs
From MaRDI portal
Publication:2874093
DOI10.1002/jgt.21716zbMath1280.05094MaRDI QIDQ2874093
Tomáš Vetrík, Peter Dankelmann
Publication date: 28 January 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2263/37325
Related Items
$t$-Strong Cliques and the Degree-Diameter Problem, The degree-diameter problem for outerplanar graphs
Cites Work
- Unnamed Item
- Complete catalogue of graphs of maximum degree 3 and defect at most 4
- On finite Moore geometries
- Regular graphs with excess one
- On graphs of defect at most 2
- Asymptotically large (\(\Delta,D\))-graphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- On Moore Geometries, I
- On Moore geometries. II
- The nonexistence of Moore geometries of diameter 4
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs