Results 151 to 160 of about 351 (173)
Some of the next articles are maybe not open access.
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. Augustine Germina
openaire +1 more source
Sparse color‐critical graphs and hypergraphs with no short cycles
Journal of Graph Theory, 1994AbstractWe give constructions of color‐critical graphs and hypergraphs with no short cycles and with relatively few edges. In particular, we show that, for each n ≧ 3, the smallest number of edges in a 3‐critical triangle‐free n‐graph (hypergraph) with m vertices is m + o(m) as m → ∞.
H. L. Abbott +2 more
openaire +1 more source
Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
Journal of Graph Theory, 2021AbstractFor fixed positive integers and , and a fixed ‐uniform hypergraph , we look for ‐vertex hypergraphs that admit the maximum number of ‐edge‐colorings with the property that there is no copy of for which all hyperedges are assigned different colors. We consider , the ‐uniform expanded complete graph, and we prove that the Turán hypergraph , the
Lucas de Oliveira Contiero +3 more
openaire +2 more sources
Coloring number and on-line Ramsey theory for graphs and hypergraphs
Combinatorica, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hal A. Kierstead, Goran Konjevod
openaire +3 more sources
List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
Discret. Math., 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zuosong Liang +2 more
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
The double reconstruction conjectures about colored hypergraphs and colored directed graphs
2005This paper introduces two new reconstruction conjectures about colored hypergraphs and colored directed graphs, and presents results about these two conjectures some of which are as follows: (1) the restricted version of the first conjecture to simple graphs is equivalent to the Ulam's Conjecture; (2) Kokay's each hypomorphic pair (X n ,Y n ), n=2,3,...
openaire +1 more source
Rainbow structures in properly edge-colored graphs and hypergraph systems
Structures arc-en-ciel dans les graphes proprement arêtes-colorés et les systèmes des hypergraphes La combinatoire extrémale est l'une des branches les plus vigoureuses des mathématiques combinatoires au cours des dernières décennies, et elle a été largement utilisée en informatique, en conception de réseaux et en conception de codage ...openaire +1 more source
Stability of Extremal Hypergraphs With Applications to an Edge-Coloring Problem
Electronic Notes in Discrete Mathematics, 2017Carlos Hoppen +2 more
exaly

