✦ LIBER ✦

Orthogonally Drawing Cubic Graphs in Parallel

✍ Scribed by Tiziana Calamoneri; Rossella Petreschi

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 417 KB
Volume: 55
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1998.1495

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path factors in cubic graphs

✍ Ken-ichi Kawarabayashi; Haruhide Matsuda; Yoshiaki Oda; Katsuhiro Ota 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB

Orthogonal Structures in Directed Graphs

✍ S. Felsner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 472 KB

Using the minimal cost flow algorithm of Ford and Fulkerson and the notion of orthogonality between chain and antichain families András Frank could give common access (and proof) to some famous results in the theory of finite posets:

Chords of Longest Cycles in Cubic Graphs

✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 213 KB

We describe a general sufficient condition for a Hamiltonian graph to contain another Hamiltonian cycle. We apply it to prove that every longest cycle in a 3-connected cubic graph has a chord. We also verify special cases of an old conjecture of Sheehan on Hamiltonian cycles in 4-regular graphs and

Disconnected 2-Factors in Planar Cubic B

Disconnected 2-Factors in Planar Cubic Bridgeless Graphs

✍ Ajit A. Diwan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Edge proximity conditions for extendabil

Edge proximity conditions for extendability in cubic bipartite graphs

✍ R. E. L. Aldred; Bill Jackson 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

## Abstract We show that a set __M__ of __m__ edges in a cyclically (3__m__ − 2)‐edge‐connected cubic bipartite graph is contained in a 1‐factor whenever the edges in __M__ are pairwise distance at least __f__(__m__) apart, where © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 112–120, 2007

Cycles containing 12 vertices in 3-conne

Cycles containing 12 vertices in 3-connected cubic graphs

✍ Sheng Bau; Derek Holton 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

## Abstract A necessary and sufficient condition is obtained for a set of 12 vertices in any 3‐connected cubic graph to lie on a common cycle.