Circular chromatic index of graphs of maximum degree 3

  title={Circular chromatic index of graphs of maximum degree 3},
  author={Peyman Afshani and Mahsa Ghandehari and Mahya Ghandehari and Hamed Hatami and Ruzbeh Tusserkani and Xuding Zhu},
  journal={Journal of Graph Theory},
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 K  23 (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… 

Circular Chromatic Indices of Regular Graphs

The circular chromatic index of a graph G, written χc′(G) , is the minimum r permitting a function c:E(G)→[0,r) such that 1≤c(e)−c(e′)≤r−1 whenever e and e′ are adjacent. It is known that for any

Circular total chromatic numbers of graphs

k-Regular graphs with the circular chromatic index close to k

The circular chromatic index of k -regular graphs

The circular chromatic index of a graph G is the infimum of all rational numbers p/q, such that there exists a circular p/q-edge-coloring of the graph G. A natural problem is to determine the set of

Theorems and computations in circular colourings of graphs

The circular chromatic number provides a more refined measure of colourability of graphs, than does the ordinary chromatic number. Thus circular colouring is of substantial importance wherever graph

Cubic Graphs with Given Circular Chromatic Index

The construction disproves a conjecture of Zhu that there is no bounded increasing infinite sequence in the set of circular chromatic indices of graphs and describes a sequence of graphs whose circular Chromatic indices converge to 3+1/3 from above.

Circular Chromatic Index of the Szekeres snark

One of the refinements of the chromatic index which has been recently investigated is the circular chromatic index. A circular edge-coloring of a graph G is a mapping c : E(G) → [0, r) satisfying 1 ≤

Non-trivial snarks with given circular chromatic index

We introduce a new framework designed for constructing graphs with given circular chromatic index. This framework allows construction of graphs with arbitrary maximum degree and with additional

Circular Chromatic Index of Snarks

A circular $r$-edge-coloring of a graph $G$ is a mapping $c:E(G) o [0,r)$ such that for any two adjacent edges $e$ and $f$ of $G$ we have $1le |c(e)-c(f)|le r-1$. The circular chromatic index

Recent Developments in Circular Colouring of Graphs

The study of circular chromatic number Xc(G) of a graph G, which is a refinement of its chromaticNumber, has been very active in the past decade, and a glimpse of the recent progress is presented.



Circular chromatic number: a survey

Star chromatic number

A generalization of the chromatic number of a graph is introduced such that the colors are integers modulo n, and the colors on adjacent vertices are required to be as far apart as possible.

Graph Coloring Problems

Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect Graphs. Geometric and Combinatorial Graphs. Algorithms.

Nowhere-zero flow problems

  • Selected Topics in Graph Theory,
  • 1988

Introduction to graph theory

Acyclic graph coloring and the complexity of the star chromatic number

It is shown that χ* < χ if and only if a particular digraph is acyclic and that the decisioin problem associated with this question is probably not in NP though it is both NP-hard and NP-easy.