Total choosablility of planar graphs with maximum degree 5

MaRDI QIDQ2858682zbMATH OpenFDO

Authors Yanling Sun, Rui Li

Publication date 19 November 2013

Published in Applied Mathematics. Series A (Chinese Edition) (Search for Journal in Brave)

zbMATH Keywords

maximum degreeplanar graphslist total coloringmaximum average degree

Mathematics Subject Classification ID

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

Recommendations

• Total choosability of planar graphs with maximum degree 4
• On the total choosability of planar graphs and of sparse graphs
• Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
• Total coloring of planar graphs with maximum degree seven
• Total coloring of planar graphs with maximum degree \(7\)

Cited in

(6)

• On the total choosability of planar graphs and of sparse graphs
• Locally planar graphs are 5-choosable
• Total choosability of planar graphs with maximum degree 4
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• Graphs of degree 4 are 5-edge-choosable
• 2-distance choosability of planar graphs with a restriction for maximum degree

This page was built for publication: Total choosablility of planar graphs with maximum degree 5

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