Results 1 to 10 of about 94 (94)
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
Journal 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 +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 Min-Max Edge q-Coloring Problem
Journal of Graph Algorithms and Applications, 2015 In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q.
Tommi Larjomaa, Alexandru Popa
doaj +1 more source
ASPECTS OF TOPOLOGICAL APPROACHES FOR DATA SCIENCE. [PDF]
Found Data Sci, 2022 Grbić J, Wu J, Xia K, Wei GW.
europepmc +1 more source
What makes a reaction network "chemical"? [PDF]
J Cheminform, 2022 Müller S, Flamm C, Stadler PF.
europepmc +1 more source
A study of cluster hypergraphs and its properties. [PDF]
Soc Netw Anal Min, 2021 Maity A +4 more
europepmc +1 more source