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

DOI10.1016/S0304-0208(08)73437-6zbMath0532.05029OpenAlexW185385248MaRDI QIDQ3313885

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

induced subgraphscolor-critical graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Subgraphs of colour-critical graphs ⋮ On constructive methods in the theory of colour-critical graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs

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