DeepAI AI Chat
Log In Sign Up

Connecting edge-colouring

by   Jørgen Bang-Jensen, et al.

This paper studies the problem of connecting edge-colouring. Given an undirected connected graph, our aim is to colour its edges with as few colours as possible so that there exists a properly coloured walk between every pair of vertices of the graph i.e. a walk that does not use consecutively two edges of the same colour. We establish that the problem can be solved in polynomial time in the size of the graph and we provide a characterization of the graphs that can be properly connected with k colours for every possible value of k.


page 1

page 2

page 3

page 4


On (1+ε)-approximate problem kernels for the Rural Postman Problem

Given a graph G=(V,E) with edge weights ω E→ N∪{0} and a subset R⊆ E of ...

Rainbow matchings in properly-coloured multigraphs

Aharoni and Berger conjectured that in any bipartite multigraph that is ...

Parameterized temporal exploration problems

In this paper we study the fixed-parameter tractability of the problem o...

Optimally reconnecting weighted graphs against an edge-destroying adversary

We introduce a model involving two adversaries Buster and Fixer taking t...

On Minimum Connecting Transition Sets in Graphs

A forbidden transition graph is a graph defined together with a set of p...

A weighted graph zeta function involved in the Szegedy walk

We define a new weighted zeta function for a finite graph and obtain its...

Disentangling Mixtures of Epidemics on Graphs

We consider the problem of learning the weighted edges of a mixture of t...