Balancing connected colourings of graphs

DOI10.37236/11256OpenAlexW4360850272MaRDI QIDQ2699645

Emil Powierski, Freddie Illingworth, Youri Tamitegama, Alexander D. Scott

Publication date: 19 April 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.04984

zbMATH Keywords

factorizationspanning treebalancetree packingHenneberg sequence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Globally balancing spanning trees

Cites Work

• The complexity of finding arc-disjoint branching flows
• On a packing problem for infinite graphs and independence spaces
• NP-completeness of some problems of partitioning and covering in graphs
• Globally balancing spanning trees
• Balancing two spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Multicolour Discrepancies

This page was built for publication: Balancing connected colourings of graphs