The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs

DOI10.1002/jgt.21716zbMath1280.05094OpenAlexW1831866336MaRDI 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

zbMATH Keywords

hypergraphdiameterdegreeclaw-free graphMoore geometry

Mathematics Subject Classification ID

Hypergraphs (05C65) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (2)

The degree-diameter problem for outerplanar graphs ⋮ $t$-Strong Cliques and the Degree-Diameter Problem

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

This page was built for publication: The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs