Edge colorings of planar graphs with maximum degree five.

MaRDI QIDQ2881256zbMATH OpenFDO

Authors Yu-Wen Wu, Jian-Liang Wu

Publication date 3 April 2012

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

maximum degreeplanar graphedge coloringedge chromatic numberclass one

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring squares of planar graphs with maximum degree at most five
• \(2\)-distance coloring of planar graphs with maximum degree \(5\)
• Injective edge coloring of graphs with maximum degree 5
• Acyclic edge coloring of planar graphs with girth at least 5
• On edge colorings of 1-planar graphs without chordal 5-cycles.
• On the fixed edge of planar graphs with minimum degree five
• Acyclic vertex coloring of graphs of maximum degree 5
• Edge colorings of planar graphs without 5-cycles with two chords
• scientific article; zbMATH DE number 19203
• Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.

Cited in

(6)

• A sufficient condition for a planar graph of maximum degree five to be class 1
• On edge colorings of 1-planar graphs without chordal 5-cycles.
• On graph proper total colorings with labelling-type restrictions
• Oriented 5-coloring of sparse plane graphs
• Distinguishing colorings of 3-connected planar graphs with five colors
• Four coloring for a subset of maximal planar graphs with minimum degree five

This page was built for publication: Edge colorings of planar graphs with maximum degree five.

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