Illingworth, Freddie;
Powierski, Emil;
Scott, Alex;
Tamitegama, Youri;
(2023)
Balancing connected colourings of graphs.
Electronic Journal of Combinatorics
, 30
(1)
, Article P1.54. 10.37236/11256.
Preview |
Text
double_trees_EJC.pdf - Published Version Download (649kB) | Preview |
Abstract
We show that the edges of any graph $G$ containing two edge-disjoint spanning trees can be blue/red coloured so that the blue and red graphs are connected and the blue and red degrees at each vertex differ by at most four. This improves a result of Hörsch. We discuss variations of the question for digraphs, infinite graphs and a computational question, and resolve two further questions of Hörsch in the negative.
| Type: | Article |
|---|---|
| Title: | Balancing connected colourings of graphs |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.37236/11256 |
| Publisher version: | http://dx.doi.org/10.37236/11256 |
| Language: | English |
| Additional information: | © The authors. Released under the CC BY license (International 4.0). |
| Keywords: | Science & Technology, Physical Sciences, Mathematics, Applied, Mathematics |
| 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-pp.ucl.ac.uk/id/eprint/10189636 |
Archive Staff Only
 |
View Item |
