Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

A proper edge coloring of a graph is said to be acyclic if any cycle is colored with at least three colors. An edge-list L of a… Expand

Highly Cited

2012

Highly Cited

2012

We study the problem of reconfiguring one list edge-coloring of a graph into another list edge-coloring by changing only one edge… Expand

2009

2009

A graph G is edge-L-colorable, if for a given edge assignment L={L(e):e@?E(G)}, there exists a proper edge-coloring @f of G such… Expand

2009

2009

We introduce the notion of (A, B)-colouring of a graph: For given vertex sets A, B, this is a colouring of the vertices in B so… Expand

2008

2008

Let G be a planar graph with maximum degree @D(G). We use @g"l^'(G) and @g"l^''(G) to denote the list edge chromatic number and… Expand

2005

2005

Abstract A total coloring of a graph G is a coloring of all elements of G , i.e., vertices and edges, in such a way that no two… Expand

2004

2004

Abstract We investigate structural properties of planar graphs without triangles or without 4-cycles, and show that every… Expand

2003

2003

Assume that each edge e of a graph G is assigned a list (set) L(e) of colors. Then an edge-coloring of G is called an L-edge… Expand

Highly Cited

1997

Highly Cited

1997

This paper exploits the remarkable new method of Galvin (J. Combin. Theory Ser. B63(1995), 153?158), who proved that the list… Expand

1992

1992

Abstract It is shown that the list edge chromatic number of any graph with maximal degree Δ and girth at least 8‡(ln ‡ + 1.1) is… Expand