Critical \((P_6, \mathrm{banner})\)-free graphs
type: Item
instance of: scholarly article
title: Critical \((P_6, \mathrm{banner})\)-free graphs
zbMATH Open document ID: 1407.05094
author: Shenwei Huang
author: Tao Li
author: Yongtang Shi
published in: Discrete Applied Mathematics
publication date: 2019-03-22T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7040831
zbMATH Keywords: coloring
zbMATH Keywords: critical graphs
zbMATH Keywords: hereditary classes
zbMATH Keywords: strong perfect graph theorem
zbMATH Keywords: polynomial-time algorithms
describes a project that uses: CriticalPfreeGraphs
MaRDI profile type: Publication
full work available at URL: j.dam.2018.11.010
OpenAlex ID: W2906676377
cites work: Q5422499
cites work: 4-colorability of \(P_6\)-free graphs
cites work: A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
cites work: Obstructions for three-coloring graphs with one forbidden induced subgraph
cites work: The strong perfect graph theorem
cites work: On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
cites work: Note on the colouring of graphs
cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
cites work: Some Theorems on Abstract Graphs
cites work: Q5732334
cites work: Q5520564
cites work: Exhaustive generation of k‐critical ‐free graphs
cites work: Complexity of coloring graphs without paths and cycles
cites work: Constructions of \(k\)-critical \(P_5\)-free graphs
cites work: Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
cites work: Certifying coloring algorithms for graphs without long induced paths
cites work: Ore's conjecture on color-critical graphs is almost true
cites work: 4-coloring \((P_6, \text{bull})\)-free graphs
cites work: Q5528475
cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
DOI: 10.1016/J.DAM.2018.11.010
description: scientific article; zbMATH DE number 7040831