✦ LIBER ✦

The number of reachable pairs in a digraph

✍ Scribed by A.R. Rao

Book ID: 108113442
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 167 KB
Volume: 306
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.03.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of reachable pairs in a digra

The number of reachable pairs in a digraph

✍ A.R. Rao 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 191 KB

The dichromatic number of a digraph

✍ V Neumann-Lara 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 321 KB

On the parallel complexity of digraph re

On the parallel complexity of digraph reachability

✍ Samir Khuller; ; ; Uzi Vishkin; 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 253 KB

The circular chromatic number of a digra

The circular chromatic number of a digraph

✍ Drago Bokal; Gas̆per Fijavz; Martin Juvan; P. Mark Kayll; Bojan Mohar 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

## Abstract We introduce the circular chromatic number χ~__c__~ of a digraph and establish various basic results. They show that the coloring theory for digraphs is similar to the coloring theory for undirected graphs when independent sets of vertices are replaced by acyclic sets. Since the directe

The number of functional digraphs

✍ Frank Harary 📂 Article 📅 1959 🏛 Springer 🌐 English ⚖ 536 KB

Reachability is decidable in the numbers

Reachability is decidable in the numbers game

✍ K. Eriksson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 579 KB