Results 1  10
of
2,003
On proper colorings of hypergraphs
"... In this paper we consider undirected graphs and hypergraphs. We denote by V (G) the vertex set of a graph G and the edge set by E(G). Notations v(G) and e(G) in our paper stand for the number of vertices and edges respectively. We denote by dG(v) the degree of vertex v ∈ V (G) in G. We denote ..."
Abstract
 Add to MetaCart
In this paper we consider undirected graphs and hypergraphs. We denote by V (G) the vertex set of a graph G and the edge set by E(G). Notations v(G) and e(G) in our paper stand for the number of vertices and edges respectively. We denote by dG(v) the degree of vertex v ∈ V (G) in G. We denote
On EdgeColored Graphs Covered by Properly Colored Cycles
 Graphs and Combinatorics
"... Abstract. We characterize edgecolored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1extendable graphs. Key words. Edgecolored graphs, properly colored cycles, 1extendable graphs, cycle covers. 1. Introduction, notation ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We characterize edgecolored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1extendable graphs. Key words. Edgecolored graphs, properly colored cycles, 1extendable graphs, cycle covers. 1. Introduction, notation
All proper colorings of every colorable BSTS(15)
 COMPUTER SCIENCE JOURNAL OF MOLDOVA
, 2010
"... A Steiner System, denoted S(t, k, v), is a vertex set X containing v vertices, and a collection of subsets of X of size k, called blocks, such that every t vertices from X are in exactly one of the blocks. A Steiner Triple System, or ST S, is a special case of a Steiner System where t = 2, k = 3 and ..."
Abstract
 Add to MetaCart
give a complete description of all proper colorings, all feasible partitions, chromatic polynomial and chromatic spectrum of every colorable BST S(15).
Characterization of edgecolored complete graphs with properly colored Hamilton paths
"... An edgecolored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. BangJensen and G. Gutin conjectured that an edgecolored complete graph G has a properly colored Hamilton path if and only if G has a spanning subgraph consisting of a properly colored path C0 ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
An edgecolored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. BangJensen and G. Gutin conjectured that an edgecolored complete graph G has a properly colored Hamilton path if and only if G has a spanning subgraph consisting of a properly colored path C0
Note on the number of proper colorings of a graph
, 2006
"... klazar at kam.mff.cuni.cz Using a counting argument called Turán sieve (with motivation in number theory), Liu and Murty proved in [3, Theorem 4] an inequality on the number of proper vertex colorings, by λ colors, of a simple graph G = (V, E) with v = V  vertices and e = E  edges: #(proper λco ..."
Abstract
 Add to MetaCart
klazar at kam.mff.cuni.cz Using a counting argument called Turán sieve (with motivation in number theory), Liu and Murty proved in [3, Theorem 4] an inequality on the number of proper vertex colorings, by λ colors, of a simple graph G = (V, E) with v = V  vertices and e = E  edges: #(proper λcolorings
Long properly colored cycles in edgecolored complete graphs
, 2013
"... Let Kcn denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(Kcn) denote the maximum number of edges of the same color incident with a vertex of Kn. A properly colored cycle (path) in Kcn is a cycle (path) in which adjacent edges have distinct colors. B. Bollob ..."
Abstract
 Add to MetaCart
Let Kcn denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(Kcn) denote the maximum number of edges of the same color incident with a vertex of Kn. A properly colored cycle (path) in Kcn is a cycle (path) in which adjacent edges have distinct colors. B
Properly colored subgraphs and rainbow subgraphs in edgecolorings with local constraints
 ALGORITHMS
, 2003
"... We consider a canonical Ramsey type problem. An edgecoloring of a graph is called mgood if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G) denote the smallest n such that every mgood edgecoloring of K n yields a properly edgecolored ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
We consider a canonical Ramsey type problem. An edgecoloring of a graph is called mgood if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G) denote the smallest n such that every mgood edgecoloring of K n yields a properly edgecolored
Properly colored Hamilton cycles in edge colored complete graphs
, 1997
"... It is shown that for every ɛ> 0 and n> n0(ɛ), any complete graph K on n vertices whose edges are colored so that no vertex is incident with more than (1 − 1 √ 2 − ɛ)n edges of the same color, contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
It is shown that for every ɛ> 0 and n> n0(ɛ), any complete graph K on n vertices whose edges are colored so that no vertex is incident with more than (1 − 1 √ 2 − ɛ)n edges of the same color, contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between
Learning to detect natural image boundaries using local brightness, color, and texture cues
 PAMI
, 2004
"... The goal of this work is to accurately detect and localize boundaries in natural scenes using local image measurements. We formulate features that respond to characteristic changes in brightness, color, and texture associated with natural boundaries. In order to combine the information from these fe ..."
Abstract

Cited by 625 (18 self)
 Add to MetaCart
The goal of this work is to accurately detect and localize boundaries in natural scenes using local image measurements. We formulate features that respond to characteristic changes in brightness, color, and texture associated with natural boundaries. In order to combine the information from
Results 1  10
of
2,003