The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2007.09.054
@@ Property / DOI: 10.1016/j.disc.2007.09.054 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2007.09.054
+Normal rank
@@ Property / OpenAlex ID @@
+W2075036370
@@ Property / OpenAlex ID: W2075036370 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Dense Triangle-Free Graphs
@@ Property / cites work: On the Structure of Dense Triangle-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4379734
@@ Property / cites work: Q4379734 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of planar graph choosability
@@ Property / cites work: The complexity of planar graph choosability / rank @@
+Normal rank
@@ Property / cites work @@
+Q4388209
@@ Property / cites work: Q4388209 / rank @@
+Normal rank
@@ Property / cites work @@
+Small graphs with chromatic number 5: A computer search
+Normal rank
@@ Property / cites work @@
+Sur le coloriage des graphs
@@ Property / cites work: Sur le coloriage des graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4248539
@@ Property / cites work: Q4248539 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2007.09.054
@@ Property / DOI: 10.1016/J.DISC.2007.09.054 / rank @@
+Normal rank