A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS (Q5232874): Difference between revisions

@@ 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 @@
+Perfect coloring and linearly χ-boundP6-free graphs
+Normal rank
@@ Property / cites work @@
+Perfect divisibility and 2‐divisibility
@@ Property / cites work: Perfect divisibility and 2‐divisibility / rank @@
+Normal rank
@@ Property / cites work @@
+Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
+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 @@
+Square-Free Graphs with No Six-Vertex Induced Path
+Normal rank
@@ Property / cites work @@
+Normal hypergraphs and the perfect graph conjecture
+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 / full work available at URL @@
+https://doi.org/10.1017/s0004972719000352
+Normal rank
@@ Property / OpenAlex ID @@
+W2930774002
@@ Property / OpenAlex ID: W2930774002 / rank @@
+Normal rank