Results 31 to 40 of about 152,670 (312)
Coloring decompositions of complete geometric graphs [PDF]
, 2019 A decomposition of a non-empty simple graph $G$ is a pair $[G,P]$, such that $P$ is a set of non-empty induced subgraphs of $G$, and every edge of $G$ belongs to exactly one subgraph in $P$.
Huemer, Clemens +2 more
core +3 more sources
Effect of different solutions on color stability of acrylic resin-based dentures
Brazilian Oral Research, 2014 The aim of this study was to evaluate the effect of thermocycling and immersion in mouthwash or beverage solutions on the color stability of four different acrylic resin-based dentures (Onda Cryl, OC; QC20, QC; Classico, CL; and Lucitone, LU).
Marcelo Coelho Goiato +4 more
doaj +1 more source
On Twin Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2014 A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring.
Andrews Eric +4 more
doaj +1 more source
Extending edge‐colorings of complete hypergraphs into regular colorings [PDF]
Journal of Graph Theory, 2018 AbstractLet be the collection of all ‐subsets of an ‐set . Given a coloring (partition) of a set , we are interested in finding conditions under which this coloring is extendible to a coloring of so that the number of times each element of appears in each color class (all sets of the same color) is the same number .
openaire +2 more sources
Interval Incidence Coloring of Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is NP-complete, and ...
Małafiejska Anna, Małafiejski Michał
doaj +1 more source
An application of a strong and complete intuitionistic fuzzy graph by the concept of fuzzy coloring [PDF]
Notes on IFSThe hypothesis of fuzzy coloring to a strong and complete intuitionistic fuzzy graph is conferred with a real time application. The conduction of the Academic Leadership Committee Meeting of a higher educational institution is illustrated using the ...
R. Buvaneswari, P. Revathy
doaj +1 more source
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Archives of Control Sciences, 2015 In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP-complete within a broad spectrum ...
Furmańczyk Hanna, Kubale Marek
doaj +1 more source
On multiset colorings of generalized corona graphs [PDF]
Mathematica Bohemica, 2016 A vertex $k$-coloring of a graph $G$ is a \emph{multiset $k$-coloring} if $M(u)\neq M(v)$ for every edge $uv\in E(G)$, where $M(u)$ and $M(v)$ denote the multisets of colors of the neighbors of $u$ and $v$, respectively. The minimum $k$ for which $G$ has
Yun Feng, Wensong Lin
doaj +1 more source
Complexity of Coloring Graphs without Paths and Cycles
, 2013 Let $P_t$ and $C_\ell$ denote a path on $t$ vertices and a cycle on $\ell$ vertices, respectively. In this paper we study the $k$-coloring problem for $(P_t,C_\ell)$-free graphs.
A. Brandstädt +16 more
core +1 more source
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs [PDF]
Graphs and Combinatorics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Ruonan +2 more
openaire +2 more sources