On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-023-01088-5
+Normal rank
@@ Property / OpenAlex ID @@
+W4387654926
@@ Property / OpenAlex ID: W4387654926 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating cliques in \(P_ 5\)-free graphs
@@ Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
+Normal rank
@@ Property / cites work @@
+On the chromatic number of \(2 K_2\)-free graphs
@@ Property / cites work: On the chromatic number of \(2 K_2\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect divisibility and 2‐divisibility
@@ Property / cites work: Perfect divisibility and 2‐divisibility / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring graphs with no induced five‐vertex path or gem
+Normal rank
@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of \(\{P_5,K_4\}\)-free graphs
+Normal rank
@@ Property / cites work @@
+On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
+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 @@
+On graphs with no induced five‐vertex path or paraglider
+Normal rank
@@ Property / cites work @@
+Vizing bound for the chromatic number on some graph classes
+Normal rank
@@ Property / cites work @@
+Chromatic bounds for some classes of \(2 K_2\)-free graphs
+Normal rank
@@ Property / cites work @@
+Chromatic number of \(P_5\)-free graphs: Reed's conjecture
+Normal rank
@@ Property / cites work @@
+On the chromatic number of (P_{5},windmill)-free graphs
+Normal rank
@@ Property / cites work @@
+Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
+Normal rank
@@ Property / cites work @@
+Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
+Normal rank
@@ Property / cites work @@
+Q3932997
@@ Property / cites work: Q3932997 / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of graphs without certain induced subgraphs
+Normal rank