Actas de congresos
Edge Colouring Reduced Indifference Graphs
Registro en:
3540673067; 9783540673064
Lecture Notes In Computer Science (including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics). , v. 1776 LNCS, n. , p. 145 - 153, 2000.
3029743
10.1007/10719839_16
2-s2.0-84896783019
Autor
De Figueiredo C.M.H.
De Mello C.P.
Ortiz C.
Institución
Resumen
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 [n/2], 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. © Springer-Verlag Berlin Heidelberg 2000. 1776 LNCS
145 153 Cai, L., Ellis, J.A., NP-completeness of edge-colouring some restricted graphs (1991) Discrete Appl. Math., 30, pp. 15-27 De Figueiredo, C.M.H., Meidanis, J., De Mello, C.P., A linear-time algorithm for proper interval graph recognition (1995) Inform. Process. Lett., 56, pp. 179-184 De Figueiredo, C.M.H., Meidanis, J., De Mello, C.P., Local conditions for edge-coloring (1995) J. Combin. Mathematics and Combin. Computing, 31. , Technical report, DCC 17/95, UNICAMP To appear De Figueiredo, C.M.H., Meidanis, J., De Mello, C.P., On edge-colouring indifference graphs (1997) Theoret. Comput. Sci., 181, pp. 91-106 De Figueiredo, C.M.H., Meidanis, J., De Mello, C.P., Total-chromatic number and chromatic index of dually chordal graphs (1999) Inform. Process. Lett., 70, pp. 147-152 Gutierrez, M., Oubinã, L., Minimum proper interval graphs (1995) Discrete Math., 142, pp. 77-85 Hedman, B., Clique graphs of time graphs (1984) J. Combin. Theory Ser. B, 37, pp. 270-278 Hilton, A.J.W., Two conjectures on edge-colouring (1989) Discrete Math., 74, pp. 61-64 Holyer, I., The NP-completeness of edge-coloring (1981) SIAM J. Comput., 10, pp. 718-720 Misra, J., Gries, D., A constructive proof of vizing's theorem (1992) Inform. Process. Lett., 41, pp. 131-133 Roberts, F.S., On the compatibility between a graph and a simple order (1971) J. Combin. Theory Ser. B, 11, pp. 28-38 Vizing, V.G., On an estimate of the chromatic class of a p-graph (1964) Diskrete Analiz., 3, pp. 25-30. , In Russian