AbstractWe show that there is exactly one 3-critical graph of order 22 and that there are exactly nine of order 24. The graph of order 22 is shown to be the smallest 3-critical graph of even order. We also show that there are exactly two 4-critical graphs of order 18, and that these graphs are the smallest 4-critical graphs of even order. The results are obtained with the aid of a computer
AbstractA new method is developed for constructing graphs with maximum vertex degree 3 and chromatic...
In this paper, we provide further insights into the reducibility of 3-critical graphs. A graph is 3-...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
AbstractA simple graph is said to be of class 1 or of class 2 according as its chromatic index equal...
AbstractIt is shown that the number of vertices of valency 2 in a critical graph with chromatic inde...
AbstractThe vertex-critical graph conjecture (critical graph conjecture respectively) states that ev...
AbstractA graph is chromatic-index-critical if it cannot be edge-coloured with Δ colours (with Δ the...
A k-critrical graph G has maximum degree k 0, chromatic index Ø 0 (G) = k + 1 and Ø 0 (G \Gamm...
Using a technique which is inspired by topology we construct original examples of 3- and 4-edge crit...
AbstractSome results on the distribution of critical subgraphs in colour-critical graphs are obtaine...
Grünewald S. Chromatic index critical graphs and multigraphs. Bielefeld (Germany): Bielefeld Univers...
AbstractSeveral structure theorems on chromatic index critical graphs are proved. New lower bounds o...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractErdős asked if the removal of few edges in a large 4-color-critical graph always leaves a 3-...
We consider graphs G with ∆ = 3 such that χ′(G) = 4 and χ′(G − e) = 3 for every edge e, so-called...
AbstractA new method is developed for constructing graphs with maximum vertex degree 3 and chromatic...
In this paper, we provide further insights into the reducibility of 3-critical graphs. A graph is 3-...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
AbstractA simple graph is said to be of class 1 or of class 2 according as its chromatic index equal...
AbstractIt is shown that the number of vertices of valency 2 in a critical graph with chromatic inde...
AbstractThe vertex-critical graph conjecture (critical graph conjecture respectively) states that ev...
AbstractA graph is chromatic-index-critical if it cannot be edge-coloured with Δ colours (with Δ the...
A k-critrical graph G has maximum degree k 0, chromatic index Ø 0 (G) = k + 1 and Ø 0 (G \Gamm...
Using a technique which is inspired by topology we construct original examples of 3- and 4-edge crit...
AbstractSome results on the distribution of critical subgraphs in colour-critical graphs are obtaine...
Grünewald S. Chromatic index critical graphs and multigraphs. Bielefeld (Germany): Bielefeld Univers...
AbstractSeveral structure theorems on chromatic index critical graphs are proved. New lower bounds o...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractErdős asked if the removal of few edges in a large 4-color-critical graph always leaves a 3-...
We consider graphs G with ∆ = 3 such that χ′(G) = 4 and χ′(G − e) = 3 for every edge e, so-called...
AbstractA new method is developed for constructing graphs with maximum vertex degree 3 and chromatic...
In this paper, we provide further insights into the reducibility of 3-critical graphs. A graph is 3-...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
DOI
Add to ORKG