Edge Coloring of Triangle-Free 1-Planar Graphs

MaRDI QIDQ3017188zbMATH OpenFDO

Authors Xin Zhang, Guizhen Liu, Jian-Liang Wu

Publication date 19 July 2011

Full work available at URL https://arxiv.org/abs/1012.5921

zbMATH Keywords

1-planar graphedge chromatic numbertriangle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: it is shown that each triangle-free 1-planar graph with maximum degree $Deltageq7$ can be $Delta$-colorable by Discharging Method.

Cited in

(8)

• Light subgraphs in the family of 1-planar graphs with high minimum degree
• On total colorings of 1-planar graphs
• On edge colorings of 1-toroidal graphs
• Note on improper coloring of 1-planar graphs.
• On graph proper total colorings with labelling-type restrictions
• On (p,1)-total labelling of 1-planar graphs
• List edge and list total coloring of 1-planar graphs
• Acyclic edge coloring of triangle-free 1-planar graphs

This page was built for publication: Edge Coloring of Triangle-Free 1-Planar Graphs

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