On low rank-width colorings

DOI10.1007/978-3-319-68705-6_28zbMath1483.05185arXiv1703.03304OpenAlexW2604330677MaRDI QIDQ5915798

Sebastian Siebertz, Michał Pilipczuk, O-joung Kwon

Publication date: 4 January 2018

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.03304

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Unnamed Item ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ On low rank-width colorings

This page was built for publication: On low rank-width colorings