On simultaneous colorings of embedded graphs

DOI10.1016/S0012-365X(00)00064-9MaRDI QIDQ1586769zbMATH OpenOpenAlexWikidataFDO

Authors Daniel P. Sanders, John Maharry

Publication date 20 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00064-9

zbMATH Keywords

chromatic numbergenusimbeddingembedded graphs

Mathematics Subject Classification ID

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

Recommendations

• The edge-face coloring of graphs embedded in a surface of characteristic zero
• Edge colorings of graphs embeddable in a surface of low genus
• Edge coloring of embedded graphs with large girth
• The entire chromatic number of graphs embedded on the torus with large maximum degree
• Coloring edges of embedded graphs

Cited in

(10)

• Embedding finite graphs into graphs colored with infinitely many colors
• Graph color extensions: When Hadwiger's conjecture and embeddings help
• List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
• On \(d\)-diagonal colorings of embedded graphs of low maximum face size
• Simultaneous embedding of colored graphs
• The entire chromatic number of graphs embedded on the torus with large maximum degree
• Entire coloring of graphs embedded in a surface of nonnegative characteristic
• The edge-face coloring of graphs embedded in a surface of characteristic zero
• A structural theorem on embedded graphs and its application to colorings
• Simultaneous coloring of vertices and incidences of outerplanar graphs

This page was built for publication: On simultaneous colorings of embedded graphs

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