𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-colored graphs with applications to homogeneous faults

✍ Scribed by Yongge Wang; Yvo Desmedt

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
236 KB
Volume
111
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-colored complete graphs with altern
Edge-colored complete graphs with alternating cycles
✍ S.H. Whitesides πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 648 KB

We prove that if the edges of the complete graph on n ~4 vertices are colored so that no vertex is on more than A edges of the same color, 1 c A < n -2,, then the graph has cycles of all lengths 3 through n with no A consecutive edges the same color.

Characterization of edge-colored complet
Characterization of edge-colored complete graphs with properly colored Hamilton paths
✍ Jinfeng Feng; Hans-Erik Giesen; Yubao Guo; Gregory Gutin; Tommy Jensen; Arash Ra πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

## Abstract An edge‐colored graph __H__ is properly colored if no two adjacent edges of __H__ have the same color. In 1997, J. Bang‐Jensen and G. Gutin conjectured that an edge‐colored complete graph __G__ has a properly colored Hamilton path if and only if __G__ has a spanning subgraph consisting

Interval edge coloring of a graph with f
Interval edge coloring of a graph with forbidden colors
✍ Marek Kubale πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 596 KB

## This paper is complementary to Kubale (1989). We consider herein a problem of interval coloring the edges of a graph under the restriction that certain colors cannot be used for some edges. We give lower and upper bounds on the minimum number of colors required for such a coloring. Since the ge