Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-017-1870-8
@@ Property / DOI: 10.1007/s00373-017-1870-8 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.07177
@@ Property / arXiv ID: 1610.07177 / rank @@
+Normal rank
@@ Property / cites work @@
+On (\(P_{5}\), diamond)-free graphs
@@ Property / cites work: On (\(P_{5}\), diamond)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with no induced \(C_ 4\) and \(2K_ 2\)
@@ Property / cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\) / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+(\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
+Normal rank
@@ Property / cites work @@
+On the existence of two non-neighboring subgraphs in a graph
+Normal rank
@@ Property / cites work @@
+Q5749319
@@ Property / cites work: Q5749319 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+Vizing bound for the chromatic number on some graph classes
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3496355
@@ Property / cites work: Q3496355 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex colouring and forbidden subgraphs -- a survey
+Normal rank
@@ Property / cites work @@
+On a property of the class of n-colorable graphs
@@ Property / cites work: On a property of the class of n-colorable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of graphs without certain induced subgraphs
+Normal rank
@@ Property / DOI @@
+.1007/S00373-017-1870-8
@@ Property / DOI: 10.1007/S00373-017-1870-8 / rank @@
+Normal rank