The degree-diameter problem for claw-free graphs and hypergraphs

DOI10.1002/JGT.21716MaRDI QIDQ2874093zbMATH OpenOpenAlexFDO

Authors Peter Dankelmann, Tomáš Vetrík

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

diameterclaw-free graphhypergraphdegreeMoore geometry

Mathematics Subject Classification ID

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

Recommendations

• A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
• Circumferences of claw-free graphs
• scientific article; zbMATH DE number 1381050
• scientific article; zbMATH DE number 7274067
• An approximate version of Hadwiger's conjecture for claw-free graphs
• Extremal problems on the Hamiltonicity of claw-free graphs
• Circumferences and minimum degrees in 3-connected claw-free graphs
• Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
• Circumferences in \(k\)-connected claw-free graphs
• Circumferences of regular claw-free graphs

Cites work

• scientific article; zbMATH DE number 3831957 (Why is no real title available?)
• Asymptotically large (\(\Delta,D\))-graphs
• Complete catalogue of graphs of maximum degree 3 and defect at most 4
• Moore graphs and beyond: a survey of the degree/diameter problem
• On Moore Geometries, I
• On Moore geometries. II
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• On finite Moore geometries
• On graphs of defect at most 2
• Regular graphs with excess one
• The nonexistence of Moore geometries of diameter 4

Cited in

(5)

• scientific article; zbMATH DE number 6432456 (Why is no real title available?)
• \(t\)-strong cliques and the degree-diameter problem
• The degree-diameter problem for outerplanar graphs
• \(t\)-strong cliques and the degree-diameter problem
• Bounds on the fault-diameter of graphs

This page was built for publication: The degree-diameter problem for claw-free graphs and hypergraphs

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