Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph

DOI10.1016/S0304-0208(08)73437-6MaRDI QIDQ3313885zbMATH OpenOpenAlexFDO

Authors Horst Sachs, Michael Stiebitz

Publication date 1983

Published in Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73437-6

zbMATH Keywords

color-critical graphsinduced subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 3957142
• Haj�s constructions of critical graphs
• On complete subgraphs of color-critical graphs
• Colour-critical graphs with few edges
• scientific article; zbMATH DE number 4095495

Cited in

(6)

• Subgraphs of colour-critical graphs
• On constructive methods in the theory of colour-critical graphs
• Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• scientific article; zbMATH DE number 3957142 (Why is no real title available?)
• On strongly and robustly critical graphs

This page was built for publication: Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph

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