✦ LIBER ✦

Homomorphisms to oriented paths

✍ Scribed by Pavol Hell; Xuding Zhu

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 523 KB
Volume: 132
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90235-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Homomorphisms to oriented cycles

✍ Pavol Hell; Huishan Zhou; Xuding Zhu 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 807 KB

A Polynomial Algorithm for Homomorphisms

A Polynomial Algorithm for Homomorphisms to Oriented Cycles

✍ X.D. Zhu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 559 KB

W. Gutjahr, E. Welzl, and G. Woeginger have given a polynomial time algorithm to decide whether a given digraph is homomorphic to an oriented path. The corresponding problem for oriented cycles (i.e., given a digraph $G$, is it homomorphic to a fixed oriented cycle $C$ ?) remained open. We prove

Partitioning oriented 2-paths

✍ Katherine Heinrich 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB

## Abstract There are three types of oriented 2‐paths. Necessary and sufficient conditions are given under which all oriented 2‐paths of the same type and with vertices labeled 1, 2,…., __n__ can be partitioned into copies of the complete symmetric directed graph with __n__ vertices.

Hamiltonian paths in oriented graphs

✍ Maria Overbeck-Larisch 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Homomorphism bounds for oriented planar

Homomorphism bounds for oriented planar graphs

✍ T. H. Marshall 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract If ${\cal C}$ is a class of oriented graphs (directed graphs without opposite arcs), then an oriented graph is a __homomorphism bound__ for ${\cal C}$ if there is a homomorphism from each graph in ${\cal C}$ to __H__. We find some necessary conditions for a graph to be a homomorphism bo

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{