On Vizing's edge colouring question

07/16/2021
by   Marthe Bonamy, et al.
0

Soon after his 1964 seminal paper on edge colouring, Vizing asked the following question: can an optimal edge colouring be reached from any given proper edge colouring through a series of Kempe changes? We answer this question in the affirmative for triangle-free graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2017

Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count

We show that triangle-free penny graphs have degeneracy at most two, lis...
research
07/15/2019

Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs

An orientation of G is a digraph obtained from G by replacing each edge ...
research
01/09/2022

Qualitative representations of chromatic algebras

Conventional Ramsey-theoretic investigations for edge-colourings of comp...
research
05/03/2023

The independence ratio of 4-cycle-free planar graphs

We prove that every n-vertex planar graph G with no triangle sharing an ...
research
05/11/2018

Decision problems for Clark-congruential languages

A common question when studying a class of context-free grammars is whet...
research
04/04/2023

Constructing extremal triangle-free graphs using integer programming

The maximum number of edges in a graph with matching number m and maximu...
research
05/28/2023

Shield tilings

We provide a complete description of the edge-to-edge tilings with a reg...

Please sign up or login with your details

Forgot password? Click here to reset