On the colorings of outerplanar graphs

DOI10.1016/0012-365X(94)00242-BzbMath0838.05053OpenAlexW2044529616MaRDI QIDQ1910522

Wei Fan Wang

Publication date: 24 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00242-b

zbMATH Keywords

chromatic numbercoloringsouterplanar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The entire choosability of plane graphs ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ The entire coloring of series-parallel graphs

Cites Work

• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• A seven-color theorem on the sphere
• On the total coloring of planar graphs.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the colorings of outerplanar graphs