Improved bounds on the chromatic number of ($P_5$, flag)-free graphs (Q6098088): Difference between revisions

@@ Property / cites work @@
+Triangle-free graphs and forbidden subgraphs
@@ Property / cites work: Triangle-free graphs and forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of some \(P_5\)-free graphs
+Normal rank
@@ Property / cites work @@
+A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs
+Normal rank
@@ Property / cites work @@
+\(K_{4}\)-free graphs with no odd holes
@@ Property / cites work: \(K_{4}\)-free graphs with no odd holes / 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 @@
+$(2P_2,K_4)$-Free Graphs are 4-Colorable
@@ Property / cites work: $(2P_2,K_4)$-Free Graphs are 4-Colorable / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring graphs with no induced six-vertex path or diamond
+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 the chromatic number of (\(P_6\), diamond)-free graphs
+Normal rank
@@ Property / cites work @@
+Triangle-free \(2P_3\)-free graphs are 4-colorable
+Normal rank
@@ Property / cites work @@
+Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
+Normal rank

Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088): Difference between revisions

Latest revision as of 08:03, 1 August 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)