Circular chromatic index of graphs of maximum degree 3

Details Circular chromatic index of graphs of maximum degree 3 Circular chromatic index of graphs of maximum degree 3

2006-12-31

arxiv.org/abs/math/0701016v1

Journal of Graph Theory. 49(4) (2005) pp. 325-335

Mathematics

Combinatorics

Scientific paper

This paper proves that if $G$ is a graph (parallel edges allowed) of maximum degree 3, then $\chi_c'(G) \leq 11/3$ provided that $G$ does not contain $H_1$ or $H_2$ as a subgraph, where $H_1$ and $H_2$ are obtained by subdividing one edge of $K_2^3$ (the graph with three parallel edges between two vertices) and $K_4$, respectively. As $\chi_c'(H_1) = \chi_c'(H_2) = 4$, our result implies that there is no graph $G$ with $11/3 < \chi_c'(G) < 4$. It also implies that if $G$ is a 2-edge connected cubic graph, then $\chi'(G) \le 11/3$.

Affiliated with

Also associated with

No associations

Rating

Circular chromatic index of graphs of maximum degree 3 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Circular chromatic index of graphs of maximum degree 3, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circular chromatic index of graphs of maximum degree 3 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-294033