✦ LIBER ✦

Colored Homomorphisms of Colored Mixed Graphs

✍ Scribed by Jaroslav Nešetřil; André Raspaud

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 108 KB
Volume: 80
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1977

No coin nor oath required. For personal study only.

✦ Synopsis

The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic coloring number and oriented chromatic number, have been recently studied. Improving and combining earlier techniques of N.

📜 SIMILAR VOLUMES

Path homomorphisms, graph colorings, and

Path homomorphisms, graph colorings, and boolean matrices

✍ Jaroslav Nešetřil; Claude Tardif 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract We investigate bounds on the chromatic number of a graph __G__ derived from the nonexistence of homomorphisms from some path \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}\begin{eqnarray\*}\vec{P}\end{eqnarray\*}\end{document} into some orientation \documentclass{

Edge-colored saturated graphs

✍ D. Hanson; B. Toft 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

Totally symmetric colored graphs

✍ Mariusz Grech; Andrzej Kisielewicz 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract In this paper we describe almost all edge‐colored complete graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. This generalizes the recent description of self‐complementary symmetric graphs by Peisert and gives examples of permu

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

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

Domination in colored complete graphs

✍ P. Erdös; R. Faudree; A. Gyárfás; R. H. Schelp 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB