DeepAI AI Chat
Log In Sign Up

Tree-like distance colouring for planar graphs of sufficient girth

by   Ross J. Kang, et al.

Given a multigraph G and a positive integer t, the distance-t chromatic index of G is the least number of colours needed for a colouring of the edges so that every pair of distinct edges connected by a path of fewer than t edges must receive different colours. Let π'_t(d) and τ'_t(d) be the largest values of this parameter over the class of planar multigraphs and of (simple) trees, respectively, of maximum degree d. We have that π'_t(d) is at most and at least a non-trivial constant multiple larger than τ'_t(d). (We conjecture _d→∞π'_2(d)/τ'_2(d) =9/4 in particular.) We prove for odd t the existence of a quantity g depending only on t such that the distance-t chromatic index of any planar multigraph of maximum degree d and girth at least g is at most τ'_t(d) if d is sufficiently large. Such a quantity does not exist for even t. We also show a related, similar phenomenon for distance vertex-colouring.


page 1

page 2

page 3

page 4


Subcubic planar graphs of girth 7 are class I

We prove that planar graphs of maximum degree 3 and of girth at least 7 ...

Partitioning edges of a planar graph into linear forests and a matching

We show that the edges of any planar graph of maximum degree at most 9 c...

Elimination distance to bounded degree on planar graphs

We study the graph parameter elimination distance to bounded degree, whi...

Decomposing 4-connected planar triangulations into two trees and one path

Refining a classical proof of Whitney, we show that any 4-connected plan...

Guarding Quadrangulations and Stacked Triangulations with Edges

Let G = (V,E) be a plane graph. A face f of G is guarded by an edge vw ∈...

On the quartet distance given partial information

Let T be an arbitrary phylogenetic tree with n leaves. It is well-known ...

Rumors in a Network: Who's the Culprit?

We provide a systematic study of the problem of finding the source of a ...