A note on list edge coloring of planar graphs without adjacent short cycles.

MaRDI QIDQ5206385zbMATH OpenFDO

Authors Linna Hu, Huimin Song, Jian-Liang Wu

Publication date 18 December 2019

zbMATH Keywords

coloringcycleedge choosableplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• List edge coloring of planar graphs without non-induced 6-cycles
• List edge coloring of planar graphs without 6-cycles with two chords
• Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
• A note on list edge and list total coloring of planar graphs without adjacent short cycles
• List-edge-coloring of planar graphs without 6-cycles with three chords

Cited in

(9)

• List-edge-coloring of planar graphs without 6-cycles with three chords
• On restricted colorings of (d, s)-edge colorable graphs
• List edge coloring of planar graphs without 6-cycles with two chords
• List edge coloring of planar graphs without non-induced 6-cycles
• A note on list edge and list total coloring of planar graphs without adjacent short cycles
• List injective coloring of a class of planar graphs without short cycles
• A note on edge-choosability of planar graphs without intersecting 4-cycles
• List edge and list total colorings of planar graphs without short cycles
• Edge-choosability of planar graphs without adjacent triangles or without 7-cycles

This page was built for publication: A note on list edge coloring of planar graphs without adjacent short cycles.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206385)