In mathematics, list edge-coloring is a type of graph coloring that combines list coloring and edge coloring.An instance of a list edge-coloringâ€¦Â (More)

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

2012

2009

2009

- Daniel W. Cranston
- Discussiones Mathematicae Graph Theory
- 2009

Let G be a planar graph with no two 3-cycles sharing an edge. We show that if âˆ†(G) â‰¥ 9, then Ï‡â€²l(G) = âˆ†(G) and Ï‡ â€²â€² l (G) = âˆ†(Gâ€¦Â (More)

Is this relevant?

2009

2009

2009

- Yongzhu Chen, Weiyi Zhu, Wei-Fan Wang
- Discrete Mathematics
- 2009

Let G be a plane graph having no 5-cycles with a chord. If either âˆ† â‰¥ 6, or âˆ† = 5 and G contains no 4-cycles with a chord or no 6â€¦Â (More)

Is this relevant?

2004

2004

- Li Zhang, Baoyindureng Wu
- Discrete Mathematics
- 2004

We investigate structural properties of planar graphs without triangles or without 4-cycles, and show that every triangle-freeâ€¦Â (More)

Is this relevant?

2002

2002

- Wei-Fan Wang, Ko-Wei Lih
- Appl. Math. Lett.
- 2002

It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + lâ€¦Â (More)

Is this relevant?

2002

2002

- Wei-Fan Wang, Ko-Wei Lih
- SIAM J. Discrete Math.
- 2002

Let G be a planar graph without two triangles sharing a common vertex. We prove that (1) G is 4-choosable and (2) G is edge-(âˆ†(Gâ€¦Â (More)

Is this relevant?

2001

2001

- Wei-Fan Wang, Ko-Wei Lih
- Eur. J. Comb.
- 2001

Let Ï‡l (G), Ï‡ â€² l (G), Ï‡ â€²â€² l (G), and 1(G) denote, respectively, the list chromatic number, the list chromatic index, the listâ€¦Â (More)

Is this relevant?

1999

1992

1992

- Alexandr V. Kostochka
- Discrete Mathematics
- 1992

Kostochka, A.V., List edge chromatic number of graphs with large girth, Discrete Mathematics 101 (1992) 189-201. It is shown thatâ€¦Â (More)

Is this relevant?