A Relaxed Version of the Erdős–Lovász Tihany Conjecture (Q5272646): Difference between revisions

@@ Property / cites work @@
+The Erdős-Lovász tihany conjecture for quasi-line graphs
+Normal rank
@@ Property / cites work @@
+On odd circuits in chromatic graphs
@@ Property / cites work: On odd circuits in chromatic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing graphs with girth at least five under degree constraints
+Normal rank
@@ Property / cites work @@
+On chromatic number of graphs and set-systems
@@ Property / cites work: On chromatic number of graphs and set-systems / rank @@
+Normal rank
@@ Property / cites work @@
+Partition of graphs with condition on the connectivity and minimum degree
+Normal rank
@@ Property / cites work @@
+On decomposition of triangle-free graphs under degree constraints
+Normal rank
@@ Property / cites work @@
+Double-critical graphs and complete minors
@@ Property / cites work: Double-critical graphs and complete minors / rank @@
+Normal rank
@@ Property / cites work @@
+Partitions and edge colourings of multigraphs
@@ Property / cites work: Partitions and edge colourings of multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4206747
@@ Property / cites work: Q4206747 / rank @@
+Normal rank
@@ Property / cites work @@
+\(K_ 5\) is the only double-critical 5-chromatic graph
+Normal rank
@@ Property / cites work @@
+Q4204168
@@ Property / cites work: Q4204168 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4715286
@@ Property / cites work: Q4715286 / rank @@
+Normal rank
@@ Property / cites work @@
+An inequality for the chromatic number of a graph
@@ Property / cites work: An inequality for the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint cycles in digraphs
@@ Property / cites work: Disjoint cycles in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph decomposition with constraints on the connectivity and minimum degree
+Normal rank