Loading...
Loading...

Go to the content (press return)

c-Critical graphs with maximum degree three

Author
Fiol, M.
Type of activity
Book chapter
Book
Graph Theory, Combinatorics, and Applications
First page
403
Last page
411
Publisher
John Wiley & sons
Date of publication
1995
ISBN
0-471-30439-5 Open in new window
Repository
http://hdl.handle.net/2117/76780 Open in new window
URL
http://eu.wiley.com/ Open in new window
Abstract
Let $G$ be a (simple) gtoph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident to it have the same color. The minimum possible number of conflicting vertices that a 3- edge-coloring of G can have is called the edge-coloring degree, $d(G)$, of $G$. Here we are mainly interested in the structure of a graph $G$ with given edge-coloring degree and, in particul...
Citation
Fiol, M. c-Critical graphs with maximum degree three. A: "Graph Theory, Combinatorics, and Applications". New York: John Wiley and Sons, Inc., 1995, p. 403-411.
Keywords
c-critical graph, chromatic index, conflicting vertex, edge-coloring, edge-coloring degree, graph
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants