Note on the colouring of graphs
From MaRDI portal
Publication:2649505
DOI10.1007/BF01238034zbMath0043.38502OpenAlexW2088617128WikidataQ89358341 ScholiaQ89358341MaRDI QIDQ2649505
Publication date: 1951
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/169232
Related Items (24)
On the density of \(C_7\)-critical graphs ⋮ The proper vertex-disconnection of graphs ⋮ Graphs with chromatic number close to maximum degree ⋮ The high order spectrum of a graph and its applications in graph colouring and clique counting ⋮ Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors ⋮ Strengthening Brooks' chromatic bound on \(P_6\)-free graphs ⋮ Borodin-Kostochka conjecture holds for odd-hole-free graphs ⋮ Critical (\(P_5\), bull)-free graphs ⋮ Some results on \(k\)-critical \(P_5\)-free graphs ⋮ A new lower bound on the number of edges in colour-critical graphs and hypergraphs ⋮ Coloring hammer-free graphs with \(\Delta - 1\) colors ⋮ Ore's conjecture on color-critical graphs is almost true ⋮ Critical \((P_6, \mathrm{banner})\)-free graphs ⋮ Hadwiger's conjecture and inflations of the Petersen graph ⋮ Vizing's coloring algorithm and the fan number ⋮ A Brooks-type result for sparse critical graphs ⋮ Improved lower bounds on the number of edges in list critical and online list critical graphs ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs ⋮ Hajós and Ore constructions for digraphs ⋮ A list version of Dirac's theorem on the number of edges in colour-critical graphs ⋮ On list critical graphs ⋮ A map colour theorem for the union of graphs
This page was built for publication: Note on the colouring of graphs
