Critical hereditary graph classes: a survey (Q518125): Difference between revisions

@@ Property / author @@
+Dmitriy S. Malyshev
@@ Property / author: Dmitriy S. Malyshev / 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.1007/s11590-015-0985-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2289043657
@@ Property / OpenAlex ID: W2289043657 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dichotomy for Upper Domination in Monogenic Classes
+Normal rank
@@ Property / cites work @@
+On easy and hard hereditary classes of graphs with respect to the independent set problem
+Normal rank
@@ Property / cites work @@
+Polynomial algorithm for finding the largest independent sets in graphs without forks
+Normal rank
@@ Property / cites work @@
+NP-hard graph problems and boundary classes of graphs
+Normal rank
@@ Property / cites work @@
+Boundary classes of graphs for the dominating set problem
+Normal rank
@@ Property / cites work @@
+The Maximum Independent Set Problem in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q4425939
@@ Property / cites work: Q4425939 / rank @@
+Normal rank
@@ Property / cites work @@
+Updating the complexity status of coloring graphs without a fixed induced linear forest
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Edge ranking of weighted trees
@@ Property / cites work: Edge ranking of weighted trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3070239
@@ Property / cites work: Q3070239 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+List coloring in the absence of two subgraphs
@@ Property / cites work: List coloring in the absence of two subgraphs / rank @@
+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 @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of domination number determination in monogenic classes of graphs
+Normal rank
@@ Property / cites work @@
+Boundary properties of graphs for algorithmic graph problems
+Normal rank
@@ Property / cites work @@
+Boundary properties of well-quasi-ordered sets of graphs
+Normal rank
@@ Property / cites work @@
+Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time
+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 maximum independent set problem in subclasses of subcubic graphs
+Normal rank
@@ Property / cites work @@
+Independent sets in extensions of 2\(K_{2}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Boundary properties of the satisfiability problems
+Normal rank
@@ Property / cites work @@
+On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
+Normal rank
@@ Property / cites work @@
+Boundary Properties of Factorial Classes of Graphs
+Normal rank
@@ Property / cites work @@
+Q4427863
@@ Property / cites work: Q4427863 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115195
@@ Property / cites work: Q3115195 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115202
@@ Property / cites work: Q3115202 / rank @@
+Normal rank
@@ Property / cites work @@
+On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number
+Normal rank
@@ Property / cites work @@
+A study of the boundary graph classes for colorability problems
+Normal rank
@@ Property / cites work @@
+Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
+Normal rank
@@ Property / cites work @@
+Classes of graphs critical for the edge list-ranking problem
+Normal rank
@@ Property / cites work @@
+The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
+Normal rank
@@ Property / cites work @@
+The coloring problem for classes with two small obstructions
+Normal rank
@@ Property / cites work @@
+The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
+Normal rank
@@ Property / cites work @@
+Two cases of polynomial-time solvability for the coloring problem
+Normal rank
@@ Property / cites work @@
+Computing independent sets in graphs with large girth
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+Towards an Isomorphism Dichotomy for Hereditary Graph Classes
+Normal rank
@@ Property / cites work @@
+Q4552275
@@ Property / cites work: Q4552275 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3686753
@@ Property / cites work: Q3686753 / rank @@
+Normal rank