Results 111 to 120 of about 139 (132)
Some of the next articles are maybe not open access.
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
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
On the total versions of 1-2-3-Conjecture for graphs and hypergraphs
Discrete Applied Mathematics, 2023Akbar Davoodi, Leila Maherani
exaly
List-coloring clique-hypergraphs of K5-minor-free graphs strongly
Discrete Mathematics, 2020Zuosong Liang +2 more
exaly
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
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
SIAM Journal on Discrete Mathematics, 2013Panagiotis Cheilaris +2 more
exaly