On low rank-width colorings

O‐joung Kwon, Michał Pilipczuk, Sebastian Siebertz

Type: Preprint

Publication Date: 2017-03-09

Citations: 0

View

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	On low rank-width colorings	2017	O‐joung Kwon Michał Pilipczuk Sebastian Siebertz
+	On Low Rank-Width Colorings	2017	O‐joung Kwon Michał Pilipczuk Sebastian Siebertz
+	On low rank-width colorings	2019	O‐joung Kwon Michał Pilipczuk Sebastian Siebertz
+	Classes of graphs with small rank decompositions are chi-bounded	2011	Zdeněk Dvořák Daniel Kráľ
+	Classes of graphs with small rank decompositions are <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>χ</mml:mi></mml:math>-bounded	2012	Zdeněk Dvořák Daniel Kráľ
+ PDF Chat	On the generalized coloring numbers	2025	Sebastian Siebertz
+ PDF Chat	The Rank-Width of Edge-Coloured Graphs	2012	Mamadou Moustapha Kanté Michaël Rao
+	Hardness of the Generalized Coloring Numbers	2021	Michael Breen-McKay Brian Lavallee Blair D. Sullivan
+	On the complexity of finding large odd induced subgraphs and odd colorings	2020	Rémy Belmonte Ignasi Sau
+	F-rank-width of (edge-colored) graphs	2011	Mamadou Moustapha Kanté Michaël Rao
+ PDF Chat	Linear Rank-Width of Distance-Hereditary Graphs	2014	Isolde Adler Mamadou Moustapha Kanté O‐joung Kwon
+ PDF Chat	On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings	2021	Rémy Belmonte Ignasi Sau
+ PDF Chat	On rank-width of even-hole-free graphs	2017	Isolde Adler Ngoc Khang Le Haiko Müller Marko Radovanović Nicolas Trotignon Kristina Vušković
+	Erdős-Hajnal properties for powers of sparse graphs	2020	Marcin Briański Piotr Micek Michał Pilipczuk Michał T. Seweryn
+	From $χ$- to $χ_p$-bounded classes	2020	Yiting Jiang Jaroslav Nešetřil Patrice Ossona de Mendez
+ PDF Chat	On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings	2020	Rémy Belmonte Ignasi Sau
+ PDF Chat	Bounded Max-colorings of Graphs	2010	Evripidis Bampis Alexander Kononov Giorgio Lucarelli Ioannis Milis
+	Bounded max-colorings of graphs	2013	Evripidis Bampis Alexander Kononov Giorgio Lucarelli Ioannis Milis
+	Erdös--Hajnal Properties for Powers of Sparse Graphs	2021	Marcin Briański Piotr Micek Michał Pilipczuk Michał T. Seweryn
+	Grad and classes with bounded expansion I. decompositions	2005	Jaroslav Nešetřil Patrice Ossona de Mendez

Cited by (0)

Action	Title	Year	Authors

Citing (25)

Action	Title	Year	Authors
+	Minimal Universal Bipartite Graphs.	2007	Vadim Lozin Gábor Rudolf
+	Orderings on Graphs and Game Coloring Number	2003	H. A. Kierstead Daqing Yang
+ PDF Chat	Grad and classes with bounded expansion I. Decompositions	2007	Jaroslav Nešetřil Patrice Ossona de Mendez
+	On nowhere dense graphs	2011	Jaroslav Nešetřil Patrice Ossona de Mendez
+	Classes of graphs with small rank decompositions are <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>χ</mml:mi></mml:math>-bounded	2012	Zdeněk Dvořák Daniel Kráľ
+	Ramsey-type theorems	1989	Paul Erdős A. Hajnal
+	Excluding any graph as a minor allows a low tree-width 2-coloring	2004	Matt DeVos Guoli Ding Bogdan Oporowski Daniel P. Sanders Bruce Reed Paul Seymour Dirk Vertigan
+ PDF Chat	Deciding first-order properties of nowhere dense graphs	2014	Martin Grohe Stephan Kreutzer Sebastian Siebertz
+	Tree-depth, subgraph coloring and homomorphism bounds	2005	Jaroslav Nešetřil Patrice Ossona de Mendez
+	Approximating clique-width and branch-width	2006	Sang‐il Oum Paul Seymour
+	The NLC-width and clique-width for powers of graphs of bounded tree-width	2008	Frank Gurski Egon Wanke
+ PDF Chat	Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs	2015	Konrad K. Dabrowski Daniël Paulusma
+ PDF Chat	The Erdös–Hajnal Conjecture—A Survey	2013	Maria Chudnovsky
+	On the order of countable graphs	2003	Jaroslav Nešetřil Saharon Shelah
+	Colouring graphs with bounded generalized colouring number	2008	Xuding Zhu
+	Minimal Classes of Graphs of Unbounded Clique-Width	2011	Vadim Lozin
+	Boolean-width of graphs	2011	Binh-Minh Bui-Xuan Jan Arne Telle Martin Vatshelle
+	Rank-width: Algorithmic and structural results	2016	Sang‐il Oum
+	On Low Rank-Width Colorings	2017	O‐joung Kwon Michał Pilipczuk Sebastian Siebertz
+ PDF Chat	Vertex-minors and the Erdős–Hajnal conjecture	2018	Maria Chudnovsky Sang‐il Oum
+ PDF Chat	Caterpillars in Erdős–Hajnal	2018	Anita Liebenau Marcin Pilipczuk Paul Seymour Sophie Spirkl
+	Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension	2017	Jacob Fox János Pach Andrew Suk
+ PDF Chat	Erdős–Hajnal Conjecture for Graphs with Bounded VC-Dimension	2018	Jacob Fox János Pach Andrew Suk
+ PDF Chat	Problems from the world surrounding perfect graphs	1987	András Gyárfás
+ PDF Chat	Compact labelings for efficient first-order model-checking	2009	Bruno Courcelle Cyril Gavoille Mamadou Moustapha Kanté