Classes of graphs with small rank decompositions are \(\chi \)-bounded
Publication:412260
DOI10.1016/j.ejc.2011.12.005zbMath1237.05072arXiv1107.2161OpenAlexW2003779279WikidataQ57601373 ScholiaQ57601373MaRDI QIDQ412260
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.2161
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (14)
Cites Work
This page was built for publication: Classes of graphs with small rank decompositions are \(\chi \)-bounded