Results 91 to 100 of about 351 (173)

Harmonious and achromatic colorings of fragmentable hypergraphs

open access: yes, 2015
A \emph{harmonious} coloring of a $k$-uniform hypergraph $H$ is a rainbow vertex coloring such that each $k$-set of colors appears on at most one edge. A rainbow coloring of $H$ is \emph{achromatic} if each $k$-set of colors appears on at least one edge.
Dębski, Michał   +2 more
core   +1 more source

THE 1-2-3 CONJECTURE FOR HYPERGRAPHS

open access: yes, 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. In this paper we show that
Florian Pfender   +2 more
core  

Graph Set-colorings And Hypergraphs In Topological Coding [PDF]

open access: yes
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-
Yao, Bing, Ma, Fei
core  

Graph-Based Resource Allocation for Integrated Space and Terrestrial Communications. [PDF]

open access: yesSensors (Basel), 2022
Ivanov A   +4 more
europepmc   +1 more source

On the distinguishing partitions and asymmetric uniform hypergraphs

open access: yes, 2016
This study is an exposition of the first three sections of the paper entitled Distinguishing Partitions and Asymmetric Uniform Hypergraphs by Ellingham and Schroeder, which appeared in ARS Mathematica Comtemporanea [7].
Casanova, Juliet R.   +1 more
core  

Perfect sampling from spatial mixing. [PDF]

open access: yesRandom Struct Algorithms, 2022
Feng W, Guo H, Yin Y.
europepmc   +1 more source

Bipolar-valued hesitant fuzzy graph and its application. [PDF]

open access: yesSoc Netw Anal Min, 2022
Pandey SD, Ranadive AS, Samanta S.
europepmc   +1 more source

Coloring geometric hyper-graph defined by an arrangement of half-planes

open access: yes, 2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
openaire   +4 more sources

Home - About - Disclaimer - Privacy