✦ LIBER ✦

On negative cycles in mixed graphs

✍ Scribed by Esther M Arkin; Christos H Papadimitriou

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 252 KB
Volume: 4
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(85)90013-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Negative cycles in complete signed graph

Negative cycles in complete signed graphs

✍ Dragos Radu Popescu; Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 449 KB

Sparse certificates and removable cycles

Sparse certificates and removable cycles in -mixed -connected graphs

✍ Alex R. Berg; Tibor Jordán 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 165 KB

Bonferroni Inequalities and Negative Cyc

Bonferroni Inequalities and Negative Cycles in Large Complete Signed Graphs

✍ Dragoş Popescu; Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 213 KB

In this paper the problem of characterizing extremal graphs K n relatively to the number of negative p -cycles , when the number of negative edges is fixed , is solved for large n . This number can be expressed as an alternating sum for which the Bonferroni inequalities hold . Finally , the asympto

Cycles in butterfly graphs

✍ Hwang, Shien-Ching; Chen, Gen-Huey 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB 👁 3 views

Three problems in connection with cycles on the butterfly graphs are studied in this paper. The first problem is to construct complete uniform cycle partitions for the butterfly graphs. Suppose that

Packing Cycles in Graphs

✍ Guoli Ding; Wenan Zang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Extending cycles in graphs

✍ George R.T. Hendry 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 901 KB

## A cycle C in a graph G is extendable if there exists a cycle C' in G such that V(C) E V(C') and jV(C')l = IV(C) 1 + 1. A graph G is cycle extendable if G has at least one cycle and every nonhamiltonian cycle is extendable. A graph G of order p 2 3 has a pancyclic ordering if its vertices can be