Name
Abstract | ||
|---|---|---|
We show that every 2-edge-colored graph on n vertices with minimum degree at least 2n - 53 can be partitioned into two monochromatic connected subgraphs, provided n is sufficiently large. This minimum degree condition is tight and the result proves a conjecture of Bal and DeBiasio. We also make progress on another conjecture of Bal and DeBiasio on covering graphs with large minimum degree with monochromatic components of distinct colors. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1002/jgt.22435 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
covering,edge colorings,monochromatic connected subgraphs,partitioning | Journal | 91 |
Issue | ISSN | Citations |
4 | 0364-9024 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| António Girão | 1 | 1 | 3.07 |
| Shoham Letzter | 2 | 5 | 7.28 |
| J. Sahasrabudhe | 3 | 3 | 2.79 |