Consecutive Edge-Colorings of Generalized θ-Graphs
A proper edge-coloring of a graph G using positive integers as colors is said to be a consecutive edge-coloring if for each vertex the colors of edges incident form an interval of integers. Recently, Feng and Huang studied the consecutive edge-coloring of generalized θ-graphs. A generalized θ-graph is a graph consisting of m internal disjoint (u,v)-paths, where 2 ≤ m < ∞. This paper investigates a problem provided by Feng and Huang, and gives a positive answer to the problem, except two cases are left.
Unable to display preview. Download preview PDF.
- 13.Hansen, H.M.: Scheduling with minimum waiting periods. Master’s Thesis, Odense University, Odense, Denmark (1992) (in Danish)Google Scholar
- 16.Kamalian, R.R.: On interval colorings of complete bipartite graphs and trees. In: Proc. 8-th Conference on Theoretical Cybernetics of USSR, Gorkii, p. 1, pp. 145–146 (1988)Google Scholar
- 17.Kamalian, R.R.: Interval coloring of complete bipartite graphs and trees. Preprint of the Computer Center of the Academy Sciences of Armenian SSR, Yerevan (1989) (in Russian)Google Scholar
- 18.Kamalian, R.R.: Interval Edge-colorings of Graphs. Doctoral dissertation, Novosibirsk (1990)Google Scholar