A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs

DOI10.1016/j.dam.2019.11.008zbMath1439.05073OpenAlexW2991126699MaRDI QIDQ2181233

Lukas Stenmans, Rainer Schrader

Publication date: 18 May 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.11.008

zbMATH Keywords

\((q,q-4)\)-graphsde Bruijn-Erdős theoremChen and Chvátal conjecturelines in a graph

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Distance in graphs (05C12) Combinatorial geometries and geometric closure systems (51D20) Other finite incidence structures (geometric aspects) (51E30)

Related Items (1)

Solution of the Chen-Chvátal conjecture for specific classes of metric spaces

Cites Work

• The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs
• Problems related to a de Bruijn-Erdös theorem
• On the \(p\)-connectedness of graphs---a survey
• On the structure of graphs with few \(P_4\)s
• A de Bruijn-Erdős theorem for chordal graphs
• A de Bruijn-Erdős theorem for 1–2 metric spaces
• A New Class of Graphs That Satisfies the Chen‐Chvátal Conjecture
• P-Components and the Homogeneous Decomposition of Graphs

This page was built for publication: A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs