Results 1  10
of
20
Nonrainbow colorings of 3, 4 and 5connected plane graphs
"... We study vertexcolorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is 3connected plane graph with n vertices, then the number of colors in such a coloring does not exceed ¨ ˝ 7n−8. If G is 4connected, then 9 the number of col ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study vertexcolorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is 3connected plane graph with n vertices, then the number of colors in such a coloring does not exceed ¨ ˝ 7n−8. If G is 4connected, then 9 the number
Nonrainbow colorings of 3, 4 and 5connected plane graphs*
"... We study vertexcolorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3connected plane graph with n vertices, then the number of colors in such a coloring does not exceed ..."
Abstract
 Add to MetaCart
We study vertexcolorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3connected plane graph with n vertices, then the number of colors in such a coloring does not exceed
Rainbow copies of C4 in edgecolored hypercubes
, 2013
"... For positive integers k and d such that 4 ≤ k < d and k 6 = 5, we determine the maximum number of rainbow colored copies of C4 in a kedgecoloring of the ddimensional hypercube Qd. Interestingly, the kedgecolorings of Qd yielding the maximum number of rainbow copies of C4 also have the prop ..."
Abstract
 Add to MetaCart
For positive integers k and d such that 4 ≤ k < d and k 6 = 5, we determine the maximum number of rainbow colored copies of C4 in a kedgecoloring of the ddimensional hypercube Qd. Interestingly, the kedgecolorings of Qd yielding the maximum number of rainbow copies of C4 also have
Rainbows in the hypercube
, 2004
"... Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary ntuples and two vertices are adjacent iff the corresponding ntuples differ in exactly one position. An edge coloring of a graph H is called rainbow if no two edges of H have the same color. Let f(G, H) be the largest ..."
Abstract
 Add to MetaCart
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary ntuples and two vertices are adjacent iff the corresponding ntuples differ in exactly one position. An edge coloring of a graph H is called rainbow if no two edges of H have the same color. Let f(G, H) be the largest
AntiRamsey Properties of Random Graphs
, 2006
"... Abstract We call a coloring of the edge set of a graph G a bbounded coloring if no color is used morethan b times. We say that a subset of the edges of G is rainbow if each edge is of a differentcolor. A graph has property A( ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract We call a coloring of the edge set of a graph G a bbounded coloring if no color is used morethan b times. We say that a subset of the edges of G is rainbow if each edge is of a differentcolor. A graph has property A(
Evaluation of Artery Visualizations for Heart Disease Diagnosis
"... diverging color map. Abstract — Heart disease is the number one killer in the United States, and finding indicators of the disease at an early stage is critical for treatment and prevention. In this paper we evaluate visualization techniques that enable the diagnosis of coronary artery disease. A ke ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
diverging color map. Abstract — Heart disease is the number one killer in the United States, and finding indicators of the disease at an early stage is critical for treatment and prevention. In this paper we evaluate visualization techniques that enable the diagnosis of coronary artery disease. A
Results 1  10
of
20