✦ LIBER ✦

Extending cycles in bipartite graphs

✍ Scribed by George R.T Hendry

Book ID: 107884309
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 891 KB
Volume: 51
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(91)90044-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bi-cycle extendable through a given set

Bi-cycle extendable through a given set in balanced bipartite graphs

✍ Hao Li; Mei Lu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Cycles in bipartite graphs

✍ Bill Jackson 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 423 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

Long cycles in bipartite graphs

✍ Bill Jackson 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 735 KB

Hamiltonian cycles in bipartite graphs

✍ Xiaoyun Lu 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 389 KB

Extending cycles in directed graphs

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