Difference of Facial Achromatic Numbers between Two Triangular Embeddings of a Graph

From MaRDI portal
Publication:6147457



Abstract: A facial 3-complete k-coloring of a triangulation G on a surface is a vertex k-coloring such that every triple of k-colors appears on the boundary of some face of G. The facial 3-achromatic number psi3(G) of G is the maximum integer k such that G has a facial 3-complete k-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 G and G′ on a surface, psi3(G) may not be equal to psi3(G′) even if G is isomorphic to G′ as graphs. Hence, it would be interesting to see how large the difference between psi3(G) and psi3(G′) can be. We shall show that the upper bound for such difference in terms of the genus of the surface.













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)