DeepAI AI Chat

Connecting edge-colouring

06/30/2019

∙

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.

Jørgen Bang-Jensen
6 publications
Thomas Bellitto
11 publications
Anders Yeo
15 publications

page 1

page 2

page 3

page 4

∙ 12/25/2018

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 ...

0 René van Bevern, et al. ∙

∙ 10/09/2017

Rainbow matchings in properly-coloured multigraphs

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

0 Peter Keevash, et al. ∙

∙ 12/03/2022

Parameterized temporal exploration problems

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

0 Thomas Erlebach, et al. ∙

∙ 02/03/2021

Optimally reconnecting weighted graphs against an edge-destroying adversary

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

0 Daniel C. McDonald, et al. ∙

∙ 07/23/2018

On Minimum Connecting Transition Sets in Graphs

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

0 Thomas Bellitto, et al. ∙

∙ 10/11/2021

A weighted graph zeta function involved in the Szegedy walk

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

0 Ayaka Ishikawa, et al. ∙

∙ 06/14/2019

Disentangling Mixtures of Epidemics on Graphs

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

1 Jessica Hoffmann, et al. ∙