Acyclic subgraphs with high chromatic number (Q1621059): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejc.2018.07.016
@@ Property / DOI: 10.1016/j.ejc.2018.07.016 / rank @@
-Normal rank
@@ Property / cites work @@
+Oriented trees in digraphs
@@ Property / cites work: Oriented trees in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of random graphs
@@ Property / cites work: The chromatic number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3900086
@@ Property / cites work: Q3900086 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545303
@@ Property / cites work: Q5545303 / rank @@
+Normal rank
@@ Property / cites work @@
+On Sets of Acquaintances and Strangers at any Party
+Normal rank
@@ Property / cites work @@
+Zur algebraischen Begründung der Graphentheorie. I
+Normal rank
@@ Property / cites work @@
+Nombre chromatique et plus longs chemins d'un graphe
+Normal rank
@@ Property / cites work @@
+Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
+Normal rank
@@ Property / Wikidata QID @@
+Q129349024
@@ Property / Wikidata QID: Q129349024 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJC.2018.07.016
@@ Property / DOI: 10.1016/J.EJC.2018.07.016 / rank @@
+Normal rank