Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge

DOI10.1007/978-3-642-02026-1_22zbMATH Open1246.05082OpenAlexW207059514MaRDI QIDQ3637071FDOQ3637071

Authors: Jixing Wang 

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_22

Recommendations

• A vertex critical graph without critical edges
• scientific article; zbMATH DE number 4154465
• A note on a conjecture of Dirac
• Dense critical and vertex-critical graphs
• On constructive methods in the theory of colour-critical graphs

zbMATH Keywords

decompositioncompositioncritical graphDirac conjecturede-chromatic

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Infinite graphs (05C63)

Cited In (2)

• A note on a conjecture of Dirac
• A vertex critical graph without critical edges

This page was built for publication: Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge

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