✦ LIBER ✦

Acyclic Homomorphisms and Circular Colorings of Digraphs

✍ Scribed by Feder, Tomás; Hell, Pavol; Mohar, Bojan

Book ID: 118198890
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 380 KB
Volume: 17
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480103422184

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic systems of representatives and a

Acyclic systems of representatives and acyclic colorings of digraphs

✍ Ron Aharoni; Eli Berger; Ori Kfir 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract A natural digraph analog of the graph theoretic concept of “an independent set” is that of “an acyclic set of vertices,” namely a set not spanning a directed cycle. By this token, an analog of the notion of coloring of a graph is that of decomposition of a digraph into acyclic sets. We

Circular Coloring of Planar Digraphs

✍ Guanghui Wang, Bin Liu, Jiguo Yu, Guizhen Liu 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 345 KB

Eigenvalues and colorings of digraphs

✍ Bojan Mohar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Homomorphisms, representations and chara

Homomorphisms, representations and characteristic polynomials of digraphs

✍ Aiping Deng; Iwao Sato; Yaokun Wu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Acyclic and star colorings of cographs

✍ Andrew Lyons 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Acyclic edge colorings of graphs

✍ Noga Alon; Benny Sudakov; Ayal Zaks 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2‐colored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __a′__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __a′__(_