2 citations · 3 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021
Difference of facial achromatic numbers between two triangular embeddings of a graph
Kengo Enami, Yumiko Ohno
A facial -complete -coloring of a triangulation on a surface is a vertex -coloring such that every triple of -colors appears on the boundary of some face of . Th…
math.CO2021
The existence of uniform hypergraphs for which interpolation property of complete coloring fails
Nastaran Haghparast, Morteza Hasanvand, Yumiko Ohno
In 1967 Harary, Hedetniemi, and Prins showed that every graph admits a complete -coloring for every with , where denotes the chromatic number…