A greedy method for edge-colouring odd maximum degree doubly chordal graphs
نویسنده
چکیده
We describe a greedy vertex colouring method which can be used to colour optimally the edge set of certain chordal graphs. This new heuristic yields an exact edge-colouring algorithm for odd maximumdegree doubly chordal graphs. This method shows that any such graph G can be edge-coloured with maximum degree (G) colours, i.e., all these graphs are Class 1. In addition, this method gives a simple (G)+1 edge-colouring for any doubly chordal graph. We show that this class includes interval graphs.
منابع مشابه
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...
متن کاملOn the Edge-colouring of Split Graphs on the Edge-colouring of Split Graphs
We consider the following question: can split graphs with odd maximum degree be edge-coloured with maximum degree colours? We show that any odd maximum degree split graph can be transformed into a special split graph. For this special split graph, we were able to solve the question, in case the graph has a quasi-universal vertex.
متن کاملChromatic index of graphs with no cycle with a unique chord
The class C of graphs that do not contain a cycle with a unique chord was recently studied by Trotignon and Vušković [26], who proved strong structure results for these graphs. In the present paper we investigate how these structure results can be applied to solve the edgecolouring problem in the class. We give computational complexity results for the edge-colouring problem restricted to C and ...
متن کاملOn Edge-colouring Indiierence Graphs on Edge-colouring Indiierence Graphs
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suu-cient condition for 0 (G) = (G)+1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for indi...
متن کاملA new bound for parsimonious edge-colouring of graphs with maximum degree three
In a graph G of maximum degree 3, let γ(G) denote the largest fraction of edges that can be 3 edge-coloured. Rizzi [9] showed that γ(G) ≥ 1 − 2 3godd(G) where godd(G) is the odd girth of G, when G is triangle-free. In [3] we extended that result to graph with maximum degree 3. We show here that γ(G) ≥ 1− 2 3godd(G)+2 , which leads to γ(G) ≥ 15 17 when considering graphs with odd girth at least ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995