On coloring a class of claw-free and hole-twin-free graphs
type: Item
instance of: scholarly article
title: On coloring a class of claw-free and hole-twin-free graphs
author: Yingjun Dai
author: Angèle M. Foley
author: Chính T. Hoàng
published in: Discrete Applied Mathematics
publication date: 2022-11-02T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 05Cxx
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7610739
zbMATH Keywords: graph coloring
zbMATH Keywords: line-graph
zbMATH Keywords: \textit{claw}
zbMATH Keywords: hole-twin
zbMATH Keywords: \(P_7\)
MaRDI profile type: Publication
full work available at URL: j.dam.2021.09.034
OpenAlex ID: W3210518392
cites work: Characterizations of derived graphs
cites work: Topics on perfect graphs
cites work: Three-coloring and list three-coloring of graphs without induced paths on seven vertices
cites work: Clique-width for 4-vertex forbidden subgraphs
cites work: Three complexity results on coloring \(P_k\)-free graphs
cites work: The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness
cites work: Recognizing Berge graphs
cites work: The strong perfect graph theorem
cites work: Recognizing claw-free perfect graphs
cites work: Handle-rewriting hypergraph grammars
cites work: On coloring a class of claw-free graphs.
cites work: Q3216686
cites work: A coloring algorithm for \(4 K_1\)-free line graphs
cites work: Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
cites work: The NP-Completeness of Edge-Coloring
cites work: How To Color Claw-Free Perfect Graphs
cites work: Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
cites work: Reducibility among Combinatorial Problems
cites work: Treewidth. Computations and approximations
cites work: Q4448764
cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
cites work: MSOL partitioning problems on graphs of bounded treewidth and clique-width
cites work: Decomposition by clique separators
cites work: Q3686753
DOI: 10.1016/J.DAM.2021.09.034
description: scientific article; zbMATH DE number 7610739