Results 11 to 20 of about 4,016 (110)

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

$K_3$-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum [PDF]

, 2015
A $K_3$-WORM coloring of a graph $G$ is an assignment of colors to the vertices in such a way that the vertices of each $K_3$-subgraph of $G$ get precisely two colors. We study graphs $G$ which admit at least one such coloring.
Bujtás, Csilla, Tuza, Zsolt
core   +3 more sources

The 1-2-3 Conjecture for Hypergraphs [PDF]

, 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.
Kalkowski, Maciej, Karoński, Michał, Pfender, Florian   +2 more
core   +2 more sources

Spectrum of mixed bi-uniform hypergraphs [PDF]

, 2014
A mixed hypergraph is a triple $H=(V,\mathcal{C},\mathcal{D})$, where $V$ is a set of vertices, $\mathcal{C}$ and $\mathcal{D}$ are sets of hyperedges.
Axenovich, Maria, Cherubini, Enrica, Ueckerdt, Torsten   +2 more
core   +1 more source

Chromatic Ramsey number of acyclic hypergraphs [PDF]

, 2015
Suppose that $T$ is an acyclic $r$-uniform hypergraph, with $r\ge 2$. We define the ($t$-color) chromatic Ramsey number $\chi(T,t)$ as the smallest $m$ with the following property: if the edges of any $m$-chromatic $r$-uniform hypergraph are colored with
Gyárfás, András, Riasanovsky, Alexander W. N., Sherman-Bennett, Melissa U.   +2 more
core   +2 more sources

Covering complete partite hypergraphs by monochromatic components [PDF]

, 2016
A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formulated by Gy\'arf\'as: if the edges of a complete graph K are colored with ...
Gyárfás, András, Király, Zoltán
core   +2 more sources

Color-blind index in graphs of very low degree [PDF]

, 2015
Let $c:E(G)\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\bar{c}(v)=(a_1,\ldots,a_k)$, where $a_i$ is the number of edges incident to $v$ with color $i$.
Achlioptas, Alon, Arora, Balister, Bollobás, Erdős, Grünbaum, Henning, Kalinowski, McCuaig, Przybyło, Przybyło, Thomassen, Vishwanathan   +13 more
core   +3 more sources

Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals

Journal of Algebra, 2011
20 pages; v2 contains relatively minor changes in presentation and updated references.
Francisco, Christopher A., Hà, Huy Tài, Van Tuyl, Adam   +2 more
openaire   +3 more sources

Distributed Symmetry Breaking in Hypergraphs

, 2014
Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs.
A. Ephremides, A.D. Sarma, C. Avin, D. Peleg, D.G. Harris, D.P. Dubhashi, F. Dai, H. Balakrishnan, I. Chlamtac, J.A. Garay, M. Ghaffari, N. Linial, N. Linial, R. Thurimella, S. Kutten, T. Luczak, Y. Métivier   +16 more
core   +1 more source

On the connectivity threshold for colorings of random graphs and hypergraphs

, 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