✦ LIBER ✦

On the cycle polytope of a directed graph

✍ Scribed by Egon Balas; Maarten Oosten

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 185 KB
Volume: 36
Category: Article
ISSN: 0028-3045
DOI: 10.1002/1097-0037(200008)36:1<34::aid-net4>3.0.co;2-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the spectral radius of a directed gra

On the spectral radius of a directed graph

✍ Kwapisz, Jaroslaw 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB 👁 1 views

We provide upper estimates on the spectral radius of a directed graph. In particular w e prove that the spectral radius is bounded by the maximum of the geometric mean of in-degree and out-degree taken over all vertices.

Iterating the branching operation on a d

Iterating the branching operation on a directed graph

✍ Athanasiadis, Christos A. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

The branching operation D, defined by Propp, assigns to any directed graph G another directed graph D(G) whose vertices are the oriented rooted spanning trees of the original graph G. We characterize the directed graphs G for which the sequence δ(G) = (G, D(G), D 2 (G), . . .) converges, meaning tha

A matrix method for location of cycles o

A matrix method for location of cycles of a directed graph

✍ R. L. Norman 📂 Article 📅 1965 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 269 KB

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

Graphs omitting a finite set of cycles

✍ Cherlin, Gregory; Shi, Niandong 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 1 views

We prove that for C a finite set of cycles, there is a universal C-free graph if and only if C consists precisely of all the odd cycles of order less than same specified bound.

A note on mixed graphs and directed spli

A note on mixed graphs and directed splitting off

✍ Enni, Steffen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB 👁 2 views

We give counterexamples to two conjectures of Bill Jackson in Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs (Journal of Graph Theory 12(3):429-436, 1988) concerning orientations of mixed graphs and splitting off in digraphs, and prove the first conjecture