Abstract
Vizing's theorem states that the chromatic index x'(G) of a graph G is either the maximum degree Δ(G) or Δ(G)+1. A graph G is called overfull if ¦E(G)¦>Δ(G)⌊¦V(G)¦/2⌋. A sufficient condition for x'(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 indifference graphs, this is also true. As supporting evidence, we prove this conjecture for general graphs with three maximal cliques and with no universal vertex, and for indifference graphs with odd maximum degree. For the latter subclass, we prove that x'=Δ.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Cai and J. A. Ellis. NP-completeness of edge-colouring some restricted graphs. Discrete Applied Mathematics, 30:15–27, 1991.
C. M. H. de Figueiredo, J. Meidanis, and C. P. de Mello. A lexbfs algorithm for proper interval graph recognition. Technical report, Departamento de Ciência da Computação — UNICAMP, 1993.
S. Fiorini and R.J. Wilson. Edge-colourings of graphs. Pitman, London, 1977.
A. J. W. Hilton. Two conjectures on edge-colouring. Discrete Math., 74:61–64, 1989.
D. G. Hoffman and C. A. Rodger. The chromatic index of complete multipartite graphs. J. of Graph Theory, 16:159–163, 1992.
I. Holyer. The NP-completeness of edge-coloring. SIAM J. Comput., 10:718–720, 1981.
C. Ortiz. Sobre coloração de arestas. PhD thesis, COPPE-UFRJ, Rio de Janeiro, 1994. In Portuguese.
M. W. Padberg and M. R. Rao. Odd minimum cut-sets ans b-matching. Math. Oper. Res., 7:67–80, 1982.
M. Plantholt. The chromatic index of graphs with a spanning star. J. of Graph Theory, 5:45–53, 1981.
M. Plantholt. The chromatic index of graphs with large maximum degree. Discrete Math., 47:91–96, 1983.
F. S. Roberts. On the compatibility between a graph and a simple order. J. Comb. Theory (B), 11:28–38, 1971.
V. G. Vizing. On an estimate of the chromatic class of a p-graph. Diket. Analiz., 3:25–30, 1964. In russian.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Figueiredo, C.M.H., Meidanis, J., de Mello, C.P. (1995). On edge-colouring indifference graphs. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_96
Download citation
DOI: https://doi.org/10.1007/3-540-59175-3_96
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59175-7
Online ISBN: 978-3-540-49220-7
eBook Packages: Springer Book Archive