Results 21 to 30 of about 84,087 (307)
Perfectly colorable graphs [PDF]
Information Processing Letters, 2011 2 pages, 1 ...
openaire +2 more sources
Complexity of C_k-Coloring in Hereditary Classes of Graphs [PDF]
, 2019 For a graph F, a graph G is F-free if it does not contain an induced subgraph isomorphic to F. For two graphs G and H, an H-coloring of G is a mapping f:V(G) -> V(H) such that for every edge uv in E(G) it holds that f(u)f(v)in E(H).
Chudnovsky, Maria +4 more
core +3 more sources
Coloring Graphs in Oriented Coloring of Cubic Graphs
Graphs and Combinatorics, 2022 AbstractOriented coloring of an oriented graph G is an arc-preserving homomorphism from G into a tournament H. We say that the graph H is universal for a family of oriented graphs $$\mathcal {C}$$ C if for every $$G\in \mathcal {C}$$ G ∈ C
openaire +2 more sources
Solutions of Some L(2, 1)-Coloring Related Open Problems
Discussiones Mathematicae Graph Theory, 2016 An L(2, 1)-coloring (or labeling) of a graph G is a vertex coloring f : V (G) → Z+ ∪ {0} such that |f(u) − f(v)| ≥ 2 for all edges uv of G, and |f(u)−f(v)| ≥ 1 if d(u, v) = 2, where d(u, v) is the distance between vertices u and v in G.
Mandal Nibedita, Panigrahi Pratima
doaj +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
On star and acyclic coloring of generalized lexicographic product of graphs
AIMS Mathematics, 2022 A $ star \; coloring $ of a graph $ G $ is a proper vertex coloring of $ G $ such that any path of length 3 in $ G $ is not bicolored. The $ star \; chromatic \; number $ $ \chi_s(G) $ of $ G $ is the smallest integer $ k $ for which $ G $ admits a star ...
Jin Cai, Shuangliang Tian, Lizhen Peng
doaj +1 more source
On facial unique-maximum (edge-)coloring [PDF]
, 2017 A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$.
Andova, Vesna +4 more
core +3 more sources
Topological and Graph-coloring Conditions on the Parameter-independent Stability of Second-order Networked Systems [PDF]
, 2017 In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes.
Bürger, Mathias +3 more
core +2 more sources
Journal of Combinatorial Theory, Series B, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Albertson, Michael O., Moore, Emily H.
openaire +1 more source
Discrete Mathematics & Theoretical Computer ScienceWe introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by Cameron and Fon-der ...
Ben Adenbaum, Alexander Wilson
doaj +1 more source