Results 131 to 140 of about 1,904 (164)
Some of the next articles are maybe not open access.
Max-Coloring of Vertex-Weighted Graphs
Graphs and Combinatorics, 2015A proper vertex coloring of a graph \(G\) is a partition \(\{A_1, \dots, A_k\}\) of the vertex set \(V(G)\) into stable sets. For a graph \(G\) with a positive vertex weight \(c: V(G) \to (0, \infty)\), denoted by \((G, c)\), let \(\chi (G, c)\) be the minimum value of \(\sum_{i = 1}^k \max_{v \in A_i}c(v)\) over all proper vertex colorings \(\{A_1 ...
Hsiang-Chun Hsu, Gerard Jennhwa Chang
openaire +2 more sources
Adjacent Vertex Reducible Vertex-Total Coloring of Graphs
2009 International Conference on Computational Intelligence and Software Engineering, 2009Let G =( V, E) be a simple graph,k (1 ≤ k ≤ Δ(G )+1 ) is a positive integer. f is a mapping from V (G) ∪ E(G) to {1, 2, ··· ,k } such that ∀uv ∈ E(G),f (u) = f (v) and C(u )= C(v) if d(u )= d(v),we say that f is the adjacent vertex reducible vertex-total coloring of G.
Enqiang Zhu +5 more
openaire +1 more source
On N2-vertex coloring of graphs
Discrete Mathematics, Algorithms and Applications, 2018Let [Formula: see text] be a graph. A vertex coloring [Formula: see text] of [Formula: see text] is called [Formula: see text]-vertex coloring if [Formula: see text] for every vertex [Formula: see text] of [Formula: see text], where [Formula: see text] is the set of colors of vertices adjacent to [Formula: see text].
S. Akbari +3 more
openaire +2 more sources
2016
In this chapter, we study vertex colorings of graphs, where the colors are elements of \(\mathbb{Z}_{k}\) or of [k] for some integer k ≥ 2. These give rise to either edge-distinguishing labelings or proper edge colorings defined in a variety of ways.
openaire +1 more source
In this chapter, we study vertex colorings of graphs, where the colors are elements of \(\mathbb{Z}_{k}\) or of [k] for some integer k ≥ 2. These give rise to either edge-distinguishing labelings or proper edge colorings defined in a variety of ways.
openaire +1 more source
Δ-List vertex coloring in linear time
Information Processing Letters, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Track and vertex reconstruction: From classical to adaptive methods
Reviews of Modern Physics, 2010Rudolf Frühwirth
exaly
Vacuole Fusion at a Ring of Vertex Docking Sites Leaves Membrane Fragments within the Organelle
Cell, 2002William Wickner, Alexey J Merz
exaly