Smallest C₂l+1-critical graphs of odd-girth 2k+1

DOI10.1007/978-3-030-39219-2_16MaRDI QIDQ779195zbMATH OpenOpenAlexFDO

Authors Laurent Beaudou, Florent Foucaud, Reza Naserasr

Publication date 21 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-39219-2_16

zbMATH Keywords

subgraphs\(H\)-critical graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
• Note on robust critical graphs with large odd girth
• Graphs with odd girth at least seven and high minimum degree
• scientific article; zbMATH DE number 565968
• On the structure of graphs with given odd girth and large minimum degree

Cited in

(1)

• Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)

This page was built for publication: Smallest \(C_{2l+1}\)-critical graphs of odd-girth \(2k+1\)

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