On d-diagonal colorings of embedded graphs of low maximum face size

DOI10.1007/S003730050017MaRDI QIDQ1385301zbMATH OpenOpenAlexFDO

Authors Daniel P. Sanders, Yue Zhao

Publication date 2 February 1999

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003730050017

zbMATH Keywords

cyclic coloringgeneralized coloringd-diagonal coloringdiagonal coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Face colorings of embedded graphs
• Ond-diagonal colorings
• Facial incidence colorings of embedded multigraphs
• On simultaneous colorings of embedded graphs
• Publication:3201070
• A structural theorem on embedded graphs and its application to colorings
• On the maximum diameter of \(k\)-colorable graphs
• The edge-face coloring of graphs embedded in a surface of characteristic zero
• Face 2-colourable triangular embeddings of complete graphs
• -facial edge colorings of graphs

Cited in

(5)

• Coloring the faces of convex polyhedra so that like colors are far apart
• On Diagonally 10‐Coloring Plane Triangulations
• Ond-diagonal colorings
• On cyclic colorings and their generalizations
• Cyclic, diagonal and facial colorings

This page was built for publication: On \(d\)-diagonal colorings of embedded graphs of low maximum face size

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