Results 11 to 20 of about 139 (132)
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
Matchings with few colors in colored complete graphs and hypergraphs
Discrete Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
András Gyárfás, Gábor N. Sárközy
openaire +2 more sources
Local k-colorings of graphs and hypergraphs
Journal of Combinatorial Theory, Series B, 1987 A local k-coloring of a graph is a coloring of its edges such that the edges incident with any vertex are colored with at most k different colors. In this paper similarities and differences between usual and local k-coloring are investigated with respect to Ramsey type problems.
András Gyárfás +5 more
openaire +2 more sources
Bounded colorings of multipartite graphs and hypergraphs
European Journal of Combinatorics, 2017 Let $c$ be an edge-coloring of the complete $n$-vertex graph $K_n$. The problem of finding properly colored and rainbow Hamilton cycles in $c$ was initiated in 1976 by Bollobás and Erd\H os and has been extensively studied since then. Recently it was extended to the hypergraph setting by Dudek, Frieze and Ruciński.
Nina Kamcev, Benny Sudakov, Jan Volec
openaire +5 more sources
Graph Entropy Based on Strong Coloring of Uniform Hypergraphs
Axioms, 2021 The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems. Being different from the classical graph entropy, we extend this concept to a hypergraph.
Lusheng Fang +3 more
openaire +2 more sources
Turán Density of $2$-Edge-Colored Bipartite Graphs with Application on $\{2, 3\}$-Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2021 We consider the Turán problems of $2$-edge-colored graphs. A $2$-edge-colored graph $H=(V, E_r, E_b)$ is a triple consisting of the vertex set $V$, the set of red edges $E_r$ and the set of blue edges $E_b$ where $E_r$ and $E_b$ do not have to be disjoint. The Turán density $\pi(H)$ of $H$ is defined to be $\lim_{n\to\infty} \max_{G_n}h_n(G_n)$, where $
Shuliang Bai, Linyuan Lu
openaire +1 more source
On the connectivity of proper colorings of random graphs and hypergraphs
Random Structures & Algorithms, 2020 Let Ωq=Ωq(H) denote the set of proper [q]‐colorings of the hypergraph H. Let Γq be the graph with vertex set Ωq where two colorings σ,τ are adjacent iff the corresponding colorings differ in exactly one vertex. We show that if H=Hn,m;k, k ≥ 2, the random k‐uniform hypergraph with V=[n] and m=dn/k hyperedges then w.h.p.
Michael Anastos, Alan M. Frieze
openaire +3 more sources
From NMNR-coloring of hypergraphs to homogenous coloring of graphs
Ars Mathematica Contemporanea, 2017 An NMNR-coloring of a hypergraph is a coloring of vertices such that in every hyperedge at least two vertices are colored with distinct colors, and at least two vertices are colored with the same color. We prove that every 3 -uniform 3 -regular hypergraph admits an NMNR-coloring with at most 3 colors.
Janicová, Mária +3 more
openaire +3 more sources
On the connectivity threshold for colorings of random graphs and hypergraphs
CoRR, 2018 Let $Ω_q=Ω_q(H)$ denote the set of proper $[q]$-colorings of the hypergraph $H$. Let $Γ_q$ be the graph with vertex set $Ω_q$ and an edge ${σ,τ\}$ where $σ,τ$ are colorings iff $h(σ,τ)=1$. Here $h(σ,τ)$ is the Hamming distance $|\{v\in V(H):σ(v)\neqτ(v)\}|$.
Anastos, Michael, Frieze, Alan
openaire +4 more sources
On Hypergraph and Graph Isomorphism with Bounded Color Classes [PDF]
, 2006 Using logspace counting classes we study the computational complexity of hypergraph and graph isomorphism where the vertex sets have bounded color classes for certain specific bounds. We also give a polynomial-time algorithm for hypergraph isomorphism for bounded color classes of arbitrary size.
Vikraman Arvind, Johannes Köbler
openaire +1 more source