Results 1 to 10 of about 142 (135)
Adapted List Coloring of Graphs and Hypergraphs [PDF]
SIAM Journal on Discrete Mathematics, 2008 We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than these. We prove that the upper bounds on the adaptable choosability of graphs and uniform hypergraphs in terms of maximum degree are sufficiently stronger than those on the ...
Xuding Zhu, Alexandr Kostochka
exaly +2 more sources
On splittable colorings of graphs and hypergraphs [PDF]
Journal of Graph Theory, 2002 AbstractThe notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an adversary.
Zoltan Furedi
exaly +2 more sources
Coloring Face-Hypergraphs of Graphs on Surfaces
Journal of Combinatorial Theory Series B, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
André Kündgen
exaly +2 more sources
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs [PDF]
European Journal of Combinatorics, 2019 9 ...
Sergei Kiselev +2 more
exaly +4 more sources
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs [PDF]
Lecture Notes in Computer Science, 2012 We investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every hyperedge of the hypergraph the maximum color appears only once. In a conflict-free coloring, in every hyperedge of the hypergraph there is a color
Balázs Keszegh +2 more
exaly +4 more sources
Scheduling Problems and Generalized Graph Coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, andsimplicial complexes. To this coloring there is an associated symmetric function in noncommuting variables for whichwe give a deletion-contraction ...
John Machacek
doaj +1 more source
Cartesian product of hypergraphs: properties and algorithms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto +2 more
doaj +1 more source
Zero-Free Intervals of Chromatic Polynomials of Mixed Hypergraphs
Mathematics, 2022 A mixed hypergraph H is a triple (X,C,D), where X is a finite set and each of C and D is a family of subsets of X. For any positive integer λ, a proper λ-coloring of H is an assignment of λ colors to vertices in H such that each member in C contains at ...
Ruixue Zhang +2 more
doaj +1 more source
A Theoretical Investigation Based on the Rough Approximations of Hypergraphs
Journal of Mathematics, 2022 Rough sets are a key tool to model uncertainty and vagueness using upper and lower approximations without predefined functions and additional suppositions.
Musavarah Sarwar
doaj +1 more source
Graph Set-colorings And Hypergraphs In Topological Coding
CoRR, 2022 In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will introduce set-colored graphs admitting set-colorings that has been considerable cryptanalytic significance, and ...
Bing Yao, Fei Ma 0007
openaire +2 more sources