Abstract
The chromatic index problem – finding the minimum number of colours required for colouring the edges of a graph – is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal clique are consecutive in this order. Two adjacent vertices are twins if they belong to the same maximal cliques. A graph is reduced if it contains no pair of twin vertices. A graph is overfull if the total number of edges is greater than the product of the maximum degree by \(\lfloor{}n/2\rfloor\), where n is the number of vertices. We give a structural characterization for neighbourhood-overfull indifference graphs proving that a reduced indifference graph cannot be neighbourhood-overfull. We show that the chromatic index for all reduced indifference graphs is the maximum degree.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cai, L., Ellis, J.A.: NP-completeness of edge-colouring some restricted graphs. Discrete Appl. Math. 30, 15–27 (1991)
de Figueiredo, C.M.H., Meidanis, J., de Mello, C.P.: A linear-time algorithm for proper interval graph recognition. Inform. Process. Lett. 56, 179–184 (1995)
de Figueiredo, C.M.H., Meidanis, J., de Mello, C.P.: Local conditions for edge-coloring. Technical report, DCC 17/95, UNICAMP (1995); To appear in J. Combin. Mathematics and Combin. Computing 31 (1999)
de Figueiredo, C.M.H., Meidanis, J., de Mello, C.P.: On edge-colouring indifference graphs. Theoret. Comput. Sci. 181, 91–106 (1997)
de Figueiredo, C.M.H., Meidanis, J., de Mello, C.P.: Total-chromatic number and chromatic index of dually chordal graphs. Inform. Process. Lett. 70, 147–152 (1999)
Gutierrez, M., Oubiña, L.: Minimum proper interval graphs. Discrete Math. 142, 77–85 (1995)
Hedman, B.: Clique graphs of time graphs. J. Combin. Theory Ser. B 37, 270–278 (1984)
Hilton, A.J.W.: Two conjectures on edge-colouring. Discrete Math. 74, 61–64 (1989)
Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10, 718–720 (1981)
Misra, J., Gries, D.: A constructive proof of Vizing’s theorem. Inform. Process. Lett. 41, 131–133 (1992)
Roberts, F.S.: On the compatibility between a graph and a simple order. J. Combin. Theory Ser. B 11, 28–38 (1971)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskrete Analiz. 3, 25–30 (1964) (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Figueiredo, C.M.H., de Mello, C.P., Ortiz, C. (2000). Edge Colouring Reduced Indifference Graphs. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_16
Download citation
DOI: https://doi.org/10.1007/10719839_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive