✦ LIBER ✦

Edge-colored saturated graphs

✍ Scribed by D. Hanson; B. Toft

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 266 KB
Volume: 11
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190110209

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Alternating cycles in edge-colored graph

Alternating cycles in edge-colored graphs

✍ Carol Whitehead 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

We show that the edges of a 2-connected graph can be partitioned into two color classes so that every vertex is incident with edges of each color and every alternating cycle passes through a single edge. We also show that the edges of a simple graph with minimum vertex degree 6 2 2 can be partitione

Properly colored hamilton cycles in edge

Properly colored hamilton cycles in edge-colored complete graphs

✍ N. Alon; G. Gutin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB 👁 3 views

It is shown that, for ⑀ ) 0 and n ) n ⑀ , any complete graph K on n vertices 0 ' Ž . whose edges are colored so that no vertex is incident with more than 1 y 1r 2 y ⑀ n edges of the same color contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and

Edge-Coloring Bipartite Graphs

✍ Ajai Kapoor; Romeo Rizzi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 65 KB

Given a bipartite graph G with n nodes, m edges, and maximum degree ⌬, we Ž . find an edge-coloring for G using ⌬ colors in time T q O m log ⌬ , where T is the time needed to find a perfect matching in a k-regular bipartite graph with Ž . O m edges and k F ⌬. Together with best known bounds for T th

Monochromatic cycle partitions of edge-c

Monochromatic cycle partitions of edge-colored graphs

✍ Gábor N. Sárközy 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB 👁 1 views

In this article we study the monochromatic cycle partition problem for non-complete graphs. We consider graphs with a given independence number (G) = . Generalizing a classical conjecture of Erd" os, Gyárfás and Pyber, we conjecture that if we r-color the edges of a graph G with (G) = , then the ver

Rainbow faces in edge-colored plane grap

Rainbow faces in edge-colored plane graphs

✍ Stanislav Jendrol'; Jozef Miškuf; Roman Soták; Erika Škrabul'áková 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract A face of an edge‐colored plane graph is called __rainbow__ if the number of colors used on its edges is equal to its size. The maximum number of colors used in an edge coloring of a connected plane graph __G__with no rainbow face is called __the edge‐rainbowness__ of __G__. In this pap

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