Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246): Difference between revisions

@@ Property / author @@
+Stéphane Bessy
@@ Property / author: Stéphane Bessy / rank @@
+Normal rank
@@ Property / author @@
+Steéphan Thomassé
@@ Property / author: Steéphan Thomassé / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1964859857
@@ Property / OpenAlex ID: W1964859857 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
+Normal rank
@@ Property / cites work @@
+Vertex coverings by monochromatic cycles and trees
+Normal rank
@@ Property / cites work @@
+Vertex coverings by monochromatic paths and cycles
+Normal rank
@@ Property / cites work @@
+An improved bound for the monochromatic cycle partition number
+Normal rank
@@ Property / cites work @@
+Partitioning complete bipartite graphs by monochromatic cycles
+Normal rank
@@ Property / cites work @@
+Partitioning Two-Coloured Complete Graphs into  Two Monochromatic Cycles
+Normal rank