Coloring ($P_5$, kite)-free graphs with small cliques (Q6180573): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2023.11.025
@@ Property / DOI: 10.1016/j.dam.2023.11.025 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W4388750232
@@ Property / OpenAlex ID: W4388750232 / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
+Normal rank
@@ Property / cites work @@
+Triangle-free graphs and forbidden subgraphs
@@ Property / cites work: Triangle-free graphs and forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Updating the complexity status of coloring graphs without a fixed induced linear forest
+Normal rank
@@ Property / cites work @@
+Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Coloring graphs with no induced five‐vertex path or gem
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+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 @@
+Forbidden Subgraphs and 3-Colorings
@@ Property / cites work: Forbidden Subgraphs and 3-Colorings / rank @@
+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 @@
+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 @@
+Sur le coloriage des graphs
@@ Property / cites work: Sur le coloriage des graphs / rank @@
+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
@@ Property / cites work @@
+χ‐bounds, operations, and chords
@@ Property / cites work: χ‐bounds, operations, and chords / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2023.11.025
@@ Property / DOI: 10.1016/J.DAM.2023.11.025 / rank @@
+Normal rank

Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573): Difference between revisions

Latest revision as of 19:11, 30 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)