Results 11 to 20 of about 4,061 (147)
Some extremal results concerning the number of graph and hypergraph colorings [PDF]
Banach Center Publications, 1989 Ioan Tomescu
openaire +2 more sources
On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs
Acta Cybernetica, 2018 Judit Nagy-György
openaire +3 more sources
New framework for conflict-free coloring of hypergraphs and other graph coloring problems
Procedia Computer ScienceMauro Lucci +3 more
openaire +2 more sources
Equipartite colorings in graphs and hypergraphs
J. Comb. Theory B, 1977 C. Berge, F. Sterboul
openalex +2 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
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
Coloring the hypergraph of maximal cliques of a graph with no long path
Discrete Mathematics, 2003 Sylvain Gravier +2 more
openalex +2 more sources
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
Graphs with coloring redundant edges
Electronic Journal of Graph Theory and Applications, 2016 A graph edge is $d$-coloring redundant if the removal of the edge doesnot change the set of $d$-colorings of the graph. Graphs that are toosparse or too dense do not have coloring redundant edges.
Bart Demoen, Phuong-Lan Nguyen
doaj +1 more source
The 1-2-3 Conjecture for Hypergraphs [PDF]
, 2016 A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees.
Kalkowski, Maciej +2 more
core +2 more sources