Subgraphs of colour-critical graphs
type: Item
instance of: scholarly article
title: Subgraphs of colour-critical graphs
zbMATH Open document ID: 0642.05020
DOI: 10.1007/BF02579307
author: Michael Stiebitz
published in: Combinatorica
publication date: 1987-01-01T00:00:00Z
review text: The author shows that if \(k\geq 4\) is an integer, then there exists a positive integer \(n_ 0=n_ 0(k)\) such that the folloollipop graphs'' used by Thomason. G(\(\Delta)\) is defined as follows: If G is a graph with vertex set V(G) and \(\Delta\) a set of triangles of G, G(\(\Delta)\) is that bipartite graph on V(G)\(\cup \Delta\) such that \(v\in V(G)\) is adjacent to a triangle \(\delta\in \Delta\) if \(v\in \delta\).
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 4045769
zbMATH Keywords: colouring
zbMATH Keywords: critical-subgraphs
reviewed by: Norman F. Quimpo
MaRDI profile type: Publication
cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
cites work: Some Theorems on Abstract Graphs
cites work: Applications of product colouring
cites work: Paths and Circuits in Critical Graphs
cites work: Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph
cites work: Q5635464
cites work: On critical subgraphs of colour-critical graphs
cites work: Colour-critical graphs and hypergraphs
cites work: On color critical graphs
cites work: Q4121922
Recommended article: Q3726148
Recommended article: On complete subgraphs of color-critical graphs
Recommended article: Q3347909
Recommended article: Q3726147
Recommended article: Subcolorings and the subchromatic number of a graph
Recommended article: Q3699708
Recommended article: On color critical graphs
Recommended article: Subgraph-avoiding coloring of graphs
Recommended article: Colorful subgraphs in Kneser-like graphs
Recommended article: Counting substructures. I: Color critical graphs
description: scientific article; zbMATH DE number 4045769