Results 11 to 20 of about 351 (173)

Cartesian product of hypergraphs: properties and algorithms [PDF]

open access: yesElectronic 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   +3 more sources

Scheduling Problems and Generalized Graph Coloring [PDF]

open access: yesDiscrete 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   +3 more sources

An abstract approach to polychromatic coloring: Shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes

open access: yesJournal of Computational Geometry, 2019
The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets.
Balázs Keszegh, Dömötör Pálvölgyi
doaj   +2 more sources

On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs [PDF]

open access: yesActa Cybernetica, 2018
In the online coloring problem the vertices are revealed one by one to an online algorithm, which has to color them immediately as they appear. The advice complexity attempts to measure how much knowledge of the future is neccessary to achieve a given ...
Nagy-György Judit
openaire   +3 more sources

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 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
Panagiotis Cheilaris   +2 more
openaire   +6 more sources

A Theoretical Investigation Based on the Rough Approximations of Hypergraphs

open access: yesJournal 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   +2 more sources

Zero-Free Intervals of Chromatic Polynomials of Mixed Hypergraphs

open access: yesMathematics, 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   +2 more sources

Color-bounded hypergraphs, V: host graphs and subdivisions [PDF]

open access: yesDiscussiones Mathematicae Graph Theory, 2011
A color-bounded hypergraph is a hypergraph (set system) with ver- tex set X and edge set e = {E1, . . . ,Em}, together with integers si and ti satisfying 1 ≤ si ≤ ti ≤ |E1| for each i = 1, . . . ,m. A vertex coloring φ is proper if for every i, the number of colors occurring in edge 1 satisfies si ≤ |φ(Ei)| ≤ t i.
Csilla Bujtás   +2 more
openaire   +3 more sources

Distributed coloring of hypergraphs

open access: yes, 2023
For any integer r ≥ 2, a linear r-uniform hypergraph is a generalization of ordinary graphs, where edges contain r vertices and two edges intersect in at most one node. We consider the problem of coloring such hypergraphs in several constrained models of
Nolin, Alexandre   +3 more
core   +2 more sources

The $r$-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size [PDF]

open access: yes, 2023
Motivated by the analogous questions in graphs, we study the complexity of coloring and stable set problems in hypergraphs with forbidden substructures and bounded edge size.
Spirkl, Sophie   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy