Results 91 to 100 of about 4,016 (110)
Coloring of planar graphs and its relations to hypergraph coloring
Coloring of planar graphs and its relations to hypergraph coloringopenaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On hypergraph coloring and 3-uniform linear hypergraph set-indexers of a graph
Discrete Mathematics, Algorithms and Applications, 2015For a graph G = (V, E) and a nonempty set X, a linear hypergraph set-indexer (LHSI) is a function f : V(G) → 2X satisfying the following conditions: (i) f is injective (ii) the ordered pair Hf(G) = (X, f(V)), where f(V) = {f(v) : v ∈ V(G)}, is a linear hypergraph (iii) the induced function f⊕ : E → 2X defined by f⊕(uv) = f(u) ⊕ f(v), for all uv ∈ E is
Viji Paul, K A Germina
openaire +1 more source
ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS
The Quarterly Journal of Mathematics, 1993In the paper, \(k\)-local and \(k\)-mean colorings of graphs and hypergraphs are studied. Given an edge-coloring \(f\) and a vertex \(v\), \(\alpha_ f(v)\) denotes the number of distinct colors that appear on the edges incident with \(v\). A coloring \(f\) is \(k\)-local if for every vertex \(v\), \(\alpha_ f(v) \leq k\). A coloring \(f\) is \(k\)-mean
Caro, Yair, Tuza, Zsolt
openaire +2 more sources
On the total versions of 1-2-3-Conjecture for graphs and hypergraphs
Discrete Applied Mathematics, 2023Akbar Davoodi, leila maherani
exaly
A General Framework for Hypergraph Coloring
SIAM Journal on Discrete Mathematics, 2022Ian Wanless, David R Wood
exaly
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
European Journal of Combinatorics, 2019Jozsef Balogh +2 more
exaly
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
SIAM Journal on Discrete Mathematics, 2013Panagiotis Cheilaris +2 more
exaly
Coloring Face-Hypergraphs of Graphs on Surfaces
Journal of Combinatorial Theory Series B, 2002Andre Kundgen
exaly