Results 11 to 20 of about 4,035 (167)
Coloring Face-Hypergraphs of Graphs on Surfaces
Journal of Combinatorial Theory, Series B, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
André Kündgen, Radhika Ramamurthi
openalex +3 more sources
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs [PDF]
European Journal of Combinatorics, 2019 9 ...
József Balogh +2 more
openalex +4 more sources
On generalized colorings and color functions of graphs and hypergraphs
Meiqiao Zhang
semanticscholar +4 more sources
Graph Set-colorings And Hypergraphs In Topological Coding
, 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
openalex +4 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.
Mária Janicová +3 more
openalex +4 more sources
Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
Journal of Algebra, 2010 20 pages; v2 contains relatively minor changes in presentation and updated references.
Christopher A. Francisco +2 more
openalex +4 more sources
On the connectivity of proper colorings of random graphs and hypergraphs [PDF]
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 Frieze
openalex +3 more sources
Coloring [Formula: see text]-Embeddable [Formula: see text]-Uniform Hypergraphs. [PDF]
Discrete Comput Geom, 2014 This paper extends the scenario of the Four Color Theorem in the following way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly) embedded into R^d.
Heise CG +3 more
europepmc +3 more sources
Coloring clique-hypergraph of $K_5$-minor-free graphs
, 2014 A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $\mathcal{H}(G)$, of a graph $G$ has $V(G)$ as its set of vertices and the maximal cliques of $G$ as its hyperedges. A (vertex) coloring of $\mathcal{H}(G)$ is a clique-coloring of $G$. The clique-
Erfang Shan, Yuxiao Sun, Liying Kang
openalex +4 more sources
Discrete Mathematics, 1992 The authors give several combinatorial statements all trivially deducible from Rado's compactness principle.
Mirosław Truszczyński, Źsolt Tuza
openalex +4 more sources