Girão, A;
Letzter, S;
Sahasrabudhe, J;
(2019)
Partitioning a graph into monochromatic connected subgraphs.
Journal of Graph Theory
, 91
(4)
pp. 353-364.
10.1002/jgt.22435.
Preview |
Text
monocomponent-18-sep.pdf - Accepted Version Download (378kB) | Preview |
Abstract
We show that every 2-edge‐colored graph on vertices with minimum degree at least\frac{2n - 5}{3} can be partitioned into two monochromatic connected subgraphs, provided n
| Type: | Article |
|---|---|
| Title: | Partitioning a graph into monochromatic connected subgraphs |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1002/jgt.22435 |
| Publisher version: | https://doi.org/10.1002/jgt.22435 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions. |
| Keywords: | covering, edge colorings, monochromatic connected subgraphs, partitioning |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10107272 |
Downloads since deposit
47Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months
Archive Staff Only
 |
View Item |
