✦ LIBER ✦

Arc Colorings of Digraphs

✍ Scribed by C.C Harner; R.C Entringer

Book ID: 107883999
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 353 KB
Volume: 13
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90057-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Eigenvalues and colorings of digraphs

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

Acyclic Homomorphisms and Circular Color

Acyclic Homomorphisms and Circular Colorings of Digraphs

✍ Feder, Tomás; Hell, Pavol; Mohar, Bojan 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 380 KB

Gallai colorings and domination in multi

Gallai colorings and domination in multipartite digraphs

✍ András Gyárfás; Gábor Simonyi; Ágnes Tóth 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB

Restricted arc-connectivity of digraphs

✍ Lutz Volkmann 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Arc-disjoint arborescences of digraphs

✍ Cai Mao-cheng 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB

The purpose of this paper is to give a necessary and sufficient condition for a digraph G to contain k arcdisjoint arborescences so that the number rooted at each vertex x of G lies in some prescribed interval which depends on x. A digraph G = (V, E) consists of a vertex set V and an arc set E such

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