Vertex partitions by connected monochromatic \(k\)-regular graphs (Q1569063): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1006/jctb.1999.1933
+Normal rank
@@ Property / OpenAlex ID @@
+W2075905937
@@ Property / OpenAlex ID: W2075905937 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex coverings by monochromatic cycles and trees
+Normal rank
@@ Property / cites work @@
+Q3977492
@@ Property / cites work: Q3977492 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning complete bipartite graphs by monochromatic cycles
+Normal rank
@@ Property / cites work @@
+Q4878666
@@ Property / cites work: Q4878666 / rank @@
+Normal rank
@@ Property / cites work @@
+Blow-up lemma
@@ Property / cites work: Blow-up lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning Two-Coloured Complete Graphs into  Two Monochromatic Cycles
+Normal rank
@@ Property / cites work @@
+Dense graphs without 3-regular subgraphs
@@ Property / cites work: Dense graphs without 3-regular subgraphs / rank @@
+Normal rank