Chromatic number versus chromatic number in graphs with bounded clique number
From MaRDI portal
Publication:2640609
DOI10.1016/S0195-6698(13)80123-0zbMath0721.05020OpenAlexW2004627446WikidataQ105529936 ScholiaQ105529936MaRDI QIDQ2640609
H. Joseph Straight, John G. Gimbel
Publication date: 1990
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80123-0
Related Items (9)
The Micro-world of Cographs ⋮ The micro-world of cographs ⋮ A lower bound on cochromatic number for line graphs of a kind of graphs ⋮ Partitioning permutations into increasing and decreasing subsequences ⋮ Fixed-parameter algorithms for the cocoloring problem ⋮ Partitioning extended \(P_4\)-laden graphs into cliques and stable sets ⋮ Approximating minimum cocolorings. ⋮ On cocolourings and cochromatic numbers of graphs ⋮ Fractional cocoloring of graphs
Cites Work
This page was built for publication: Chromatic number versus chromatic number in graphs with bounded clique number