✦ LIBER ✦

Score sequences in oriented graphs

✍ Scribed by S. Pirzada; T. A. Naikoo; N. A. Shah

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 159 KB
Volume: 23
Category: Article
ISSN: 1598-5865
DOI: 10.1007/bf02831973

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Score sequences of oriented graphs

✍ Peter Avery 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB

## Abstract We extend Landau's concept of the score structure of a tournament to that of the score sequence of an oriented graph, and give a condition for an arbitrary integer sequence to be a score sequence. The proof is by construction of a specific oriented graph Δ(__S__) with given score sequen

Score sets in oriented 3-partite graphs

✍ S. Pirzada; Merajuddin; T. A. Naikoo 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 74 KB

Eccentric sequences in graphs

✍ Linda Lesniak 📂 Article 📅 1975 🏛 Springer Netherlands 🌐 English ⚖ 399 KB

Cycles in strong oriented graphs

✍ M.C. Heydemann 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Hamiltonian paths in oriented graphs

✍ Maria Overbeck-Larisch 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Transitive partitions in realizations of

Transitive partitions in realizations of tournament score sequences

✍ Arthur H. Busch; Guantao Chen; Michael S. Jacobson 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract A tournament is an oriented complete graph, and one containing no directed cycles is called __transitive__. A tournament __T__=(__V, A__) is called __m__‐__partition transitive__ if there is a partition such that the subtournaments induced by each __X__~__i__~ are all transitive, an