𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexes of Directed Graphs

✍ Scribed by Björner, Anders; Welker, Volkmar

Book ID
118199597
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
376 KB
Volume
12
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Directed triangles in directed graphs
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

Rankings of Directed Graphs
Rankings of Directed Graphs
✍ Kratochvíl, Jan; Tuza, Zsolt 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 286 KB
Marked directed graphs
Marked directed graphs
✍ F. Commoner; A.W. Holt; S. Even; A. Pnueli 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 670 KB

Diverse graph structure models for concurrent processing systems have been suggested and used. The structures differ in generality and scope according to the properties one wishes to model and analyze. In this paper we solve a problem of maximal storage requirements for a simple flowchart model call

Directed hamiltonian graphs
Directed hamiltonian graphs
✍ Yannis Manoussakis 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract We give a new condition involving degrees sufficient for a digraph to be hamiltonian.

Complexity of homomorphisms to direct pr
Complexity of homomorphisms to direct products of graphs
✍ Judit Büki; Csaba Szabó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 55 KB

For a graph G, OAL G asks whether or not an input graph H together with a partial map g : G 2 are trees and NP-complete otherwise.