List coloring in the absence of two subgraphs (Q2636800): Difference between revisions

@@ Property / author @@
-Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
-Normal rank
@@ Property / author @@
+Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2013.10.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2034537604
@@ Property / OpenAlex ID: W2034537604 / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a forest
@@ Property / cites work: Quickly excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width for 4-vertex forbidden subgraphs
@@ Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387674
@@ Property / cites work: Q5387674 / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of (\(P_{5}\),\,gem)-free graphs
@@ Property / cites work: On the structure of (\(P_{5}\),\,gem)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
+Normal rank
@@ Property / cites work @@
+Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Updating the complexity status of coloring graphs without a fixed induced linear forest
+Normal rank
@@ Property / cites work @@
+List Coloring in the Absence of a Linear Forest
@@ Property / cites work: List Coloring in the Absence of a Linear Forest / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring of Graphs with Ramsey-Type Forbidden Subgraphs
+Normal rank
@@ Property / cites work @@
+Colouring vertices of triangle-free graphs without forests
+Normal rank
@@ Property / cites work @@
+Choosability of P 5-Free Graphs
@@ Property / cites work: Choosability of P 5-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring Graphs Characterized by a Forbidden Subgraph
+Normal rank
@@ Property / cites work @@
+Coloring Graphs without Short Cycles and Long Induced Paths
+Normal rank
@@ Property / cites work @@
+Closing Complexity Gaps for Coloring Problems on H-Free Graphs
+Normal rank
@@ Property / cites work @@
+-coloring \(H\)-free graphs when \(H\) is small
@@ Property / cites work: 4-coloring \(H\)-free graphs when \(H\) is small / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring the hypergraph of maximal cliques of a graph with no long path
+Normal rank
@@ Property / cites work @@
+Q5749319
@@ Property / cites work: Q5749319 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of b-Perfect Graphs
@@ Property / cites work: A Characterization of b-Perfect Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Complexity Results on k-Coloring P t -Free Graphs
+Normal rank
@@ Property / cites work @@
+Generalized coloring for tree-like graphs
@@ Property / cites work: Generalized coloring for tree-like graphs / rank @@
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic complexity of list colorings
@@ Property / cites work: Algorithmic complexity of list colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs
+Normal rank
@@ Property / cites work @@
+A decidability result for the dominating set problem
+Normal rank
@@ Property / cites work @@
+Vertex coloring of graphs with few obstructions
@@ Property / cites work: Vertex coloring of graphs with few obstructions / rank @@
+Normal rank
@@ Property / cites work @@
+On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
+Normal rank
@@ Property / cites work @@
+-colorability and forbidden subgraphs. I: Characterizing pairs
+Normal rank
@@ Property / cites work @@
+Q4780499
@@ Property / cites work: Q4780499 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex colouring and forbidden subgraphs -- a survey
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Some new hereditary classes where graph coloring remains NP-hard
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2636800