Facial achromatic number of triangulations on the sphere

DOI10.1016/j.disc.2019.111651zbMath1429.05076OpenAlexW2978458644MaRDI QIDQ2279973

Naoki Matsumoto, Yumiko Ohno

Publication date: 17 December 2019

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

Full work available at URL: https://doi.org/10.1016/j.disc.2019.111651

zbMATH Keywords

triangulationfacial achromatic numberfacial complete coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Achromatic number and facial achromatic number of connected locally-connected graphs ⋮ The existence of uniform hypergraphs for which the interpolation property of complete coloring fails

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polychromatic 4-coloring of cubic even embeddings on the projective plane
• Polychromatic 4-coloring of cubic bipartite plane graphs
• Looseness of plane graphs
• Inductive definition of two restricted classes of triangulations
• \(N\)-flips in 4-connected even triangulations on the sphere
• The non-existence of colorings
• A short proof of Chvatal's Watchman Theorem
• Diagonal flips in triangulations on closed surfaces with minimum degree at least 4
• Facially-constrained colorings of plane graphs: a survey
• A new proof of 3-colorability of Eulerian triangulations
• Polychromatic colorings of bounded degree plane graphs
• Every planar map is four colorable
• On chromatic and achromatic numbers of uniform hypergraphs
• Ond-diagonal colorings
• Generating even triangulations of the projective plane
• The achromatic number of a graph
• Polychromatic colorings of plane graphs
• Harmonious and achromatic colorings of fragmentable hypergraphs

This page was built for publication: Facial achromatic number of triangulations on the sphere