Consecutive Edge-Colorings of Generalized $\theta$ -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...

Full description

Saved in:
Bibliographic Details
Published inComputational Geometry, Graphs and Applications Vol. 7033; pp. 214 - 225
Main Authors Zhao, Yongqiang, Chang, Gerard J.
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2011
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Algorithms & data structures
Discrete mathematics
Graphics programming
Online AccessGet full text
ISBN9783642249822
3642249825
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-24983-9_22

Cover

More Information
Summary: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.
ISBN:9783642249822
3642249825
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-24983-9_22