Bounding χ in terms of ω and Δ for quasi-line graphs (Q3605150): Difference between revisions

@@ Property / cites work @@
+Bisimplicial vertices in even-hole-free graphs
@@ Property / cites work: Bisimplicial vertices in even-hole-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring quasi-line graphs
@@ Property / cites work: Coloring quasi-line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bull-free Berge graphs are perfect
@@ Property / cites work: Bull-free Berge graphs are perfect / rank @@
+Normal rank
@@ Property / cites work @@
+Compositions for perfect graphs
@@ Property / cites work: Compositions for perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of line graphs
+Normal rank
@@ Property / cites work @@
+The round-up property of the fractional chromatic number for proper circular arc graphs
+Normal rank
@@ Property / cites work @@
+On the $1.1$ Edge-Coloring of Multigraphs
@@ Property / cites work: On the $1.1$ Edge-Coloring of Multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A description of claw-free perfect graphs
@@ Property / cites work: A description of claw-free perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Coloring the Lines of a Network
@@ Property / cites work: A Theorem on Coloring the Lines of a Network / rank @@
+Normal rank
@@ Property / cites work @@
+An O(qn) algorithm to q-color a proper family of circular arcs
+Normal rank