Difference of Facial Achromatic Numbers between Two Triangular Embeddings of a Graph
From MaRDI portal
Publication:6147457
Abstract: 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 . The facial -achromatic number of is the maximum integer such that has a facial -complete -coloring. This notion is an expansion of the complete coloring, that is, a proper vertex coloring of a graph such that every pair of colors appears on the ends of some edge. For two triangulations and on a surface, may not be equal to even if is isomorphic to as graphs. Hence, it would be interesting to see how large the difference between and can be. We shall show that the upper bound for such difference in terms of the genus of the surface.
Recommendations
This page was built for publication: Difference of Facial Achromatic Numbers between Two Triangular Embeddings of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147457)