Exhaustive generation of k‐critical ‐free graphs
From MaRDI portal
Publication:4604026
DOI10.1002/jgt.22151zbMath1380.05063OpenAlexW2608872852MaRDI QIDQ4604026
Jan Goedgebeur, Oliver Schaudt
Publication date: 23 February 2018
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22151
Related Items
Colouring graphs with no induced six-vertex path or diamond, 4-coloring \((P_6, \text{bull})\)-free graphs, Critical (\(P_5\), bull)-free graphs, Some results on \(k\)-critical \(P_5\)-free graphs, Better 3-coloring algorithms: excluding a triangle and a seven vertex path, Critical vertices and edges in \(H\)-free graphs, Critical \((P_6, \mathrm{banner})\)-free graphs, 3-Colorable Subclasses of $P_8$-Free Graphs, Obstructions for three-coloring graphs without induced paths on six vertices, \(k\)-critical graphs in \(P_5\)-free graphs, On 3-coloring of \((2P_4,C_5)\)-free graphs, \(k\)-critical graphs in \(P_5\)-free graphs, Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs, On 3-coloring of \((2P_4,C_5)\)-free graphs, Colouring graphs with no induced six-vertex path or diamond
Uses Software
