✦ LIBER ✦

Rankings of Directed Graphs

✍ Scribed by Kratochvíl, Jan; Tuza, Zsolt

Book ID: 118198955
Publisher: Society for Industrial and Applied Mathematics
Year: 1999
Tongue: English
Weight: 286 KB
Volume: 12
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480197330242

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rankings of Graphs

✍ Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Di 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 305 KB

Rank of adjacency matrices of directed (

Rank of adjacency matrices of directed (strongly) regular graphs

✍ L.K. Jørgensen 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Reverse mathematics and rank functions f

Reverse mathematics and rank functions for directed graphs

✍ Jeffry L. Hirst 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 95 KB

Easy and hard instances of arc ranking i

Easy and hard instances of arc ranking in directed graphs

✍ Dariusz Dereniowski 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Directed triangles in directed graphs

✍ M. de Graaf; A. Schrijver; P.D. Seymour 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 212 KB

de Graaf, M., A. Schrijver and P.D. Seymour, Directed triangles in directed graphs, Discrete Mathematics 110 (1992) 279-282. h on n vertices, each with indegree and outdegree at least n/t, contains a directed circuit of length at most

Complexes of Directed Graphs

✍ Björner, Anders; Welker, Volkmar 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 376 KB