Loading...

Circular chromatic index of graphs of maximum degree 3

Afshani, P ; Sharif University of Technology | 2005

173 Viewed
  1. Type of Document: Article
  2. DOI: 10.1002/jgt.20086
  3. Publisher: Wiley-Liss Inc , 2005
  4. Abstract:
  5. This paper proves that if G is a graph (parallel edges allowed) of maximum degree 3, then χc′(G) ≤ 11/3 provided that G does not contain H1 or H2 as a subgraph, where H1 and H2 are obtained by subdividing one edge of K23 (the graph with three parallel edges between two vertices) and K4, respectively. As χc′(H1) = χ c′(H2) = 4, our result implies that there is no graph G with 11/3 < χc′(G) < 4. It also implies that if G is a 2-edge connected cubic graph, then χc′(G) ≤ 11/3. © 2005 Wiley Periodicals, inc
  6. Keywords:
  7. Numerical methods ; Circular chromatic index ; Cubic ; Line graph ; Subgraphs ; Graph theory
  8. Source: Journal of Graph Theory ; Volume 49, Issue 4 , 2005 , Pages 325-335 ; 03649024 (ISSN)
  9. URL: https://onlinelibrary.wiley.com/doi/abs/10.1002/jgt.20086