Results 1 to 10 of about 483,308 (237)
Odd facial total-coloring of unicyclic plane graphs [PDF]
Discrete Mathematics Letters, 2022 A facial total-coloring of a plane graph G is a coloring of the vertices and edges such that no facially adjacent edges (edges that are consecutive on the boundary walk of a face of G ), no adjacent vertices, and no edge and its endvertices are assigned ...
Július Czap
doaj +2 more sources
Facial rainbow edge-coloring of simple 3-connected plane graphs [PDF]
Opuscula Mathematica, 2020 A facial rainbow edge-coloring of a plane graph \(G\) is an edge-coloring such that any two edges receive distinct colors if they lie on a common facial path of \(G\).
Július Czap
doaj +2 more sources
Facial graceful coloring of plane graphs [PDF]
Opuscula MathematicaLet \(G\) be a plane graph. Two edges of \(G\) are facially adjacent if they are consecutive on the boundary walk of a face of \(G\). A facial edge coloring of \(G\) is an edge coloring such that any two facially adjacent edges receive different colors ...
Július Czap
doaj +2 more sources
Odd facial total-coloring of maximal plane and outerplane graphs [PDF]
Contributions to MathematicsA facial total-coloring of a plane graph G is a coloring of the vertices and edges such that no facially adjacent edges, no adjacent vertices, and no edge and its endvertices are assigned the same color.
Július Czap
doaj +2 more sources
Facial Rainbow Coloring of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +2 more sources
Grünbaum colorings extended to non-facial 3-cycles
Electronic Journal of Graph Theory and Applications, 2022 We consider the question of when a triangulation with a Grünbaum coloring can be edge-colored with three colors such that the non-facial 3-cycles also receive all three colors; we will call this a strong Grünbaum coloring.
sarah-marie belcastro, Ruth Haas
doaj +2 more sources
Zig-zag facial total-coloring of plane graphs [PDF]
Opuscula Mathematica, 2018 In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain lower and upper bounds for the minimum number of colors which is necessary for such a coloring.
Július Czap +2 more
doaj +2 more sources
Odd facial colorings of acyclic plane graphs
Electronic Journal of Graph Theory and Applications, 2021 Let G be a connected plane graph with vertex set V and edge set E. For X ∈ {V, E, V ∪ E}, two elements of X are facially adjacent in G if they are incident elements, adjacent vertices, or facially adjacent edges (edges that are consecutive on the ...
Július Czap, Peter Šugerek
doaj +2 more sources
Facial Achromatic Number of Triangulations with Given Guarding Number
Theory and Applications of Graphs, 2022 A (not necessarily proper) $k$-coloring $c : V(G) \rightarrow \{1,2,\dots,k\}$ of a graph $G$ on a surface is a {\em facial $t$-complete $k$-coloring} if every $t$-tuple of colors appears on the boundary of some face of $G$.
Naoki Matsumoto, Yumiko OHNO
doaj +2 more sources
Color matching in facial prosthetics: A systematic review
The Journal of Indian Prosthodontic Society, 2017 Color matching to the surrounding skin is extremely important in patients wearing maxillofacial prostheses. It is of utmost importance to know the different techniques of color matching and coloring in maxillofacial prostheses.
Rani Ranabhatt +4 more
doaj +2 more sources