✦ LIBER ✦

Finding and listing induced paths and cycles

✍ Scribed by Hoàng, Chính T.; Kamiński, Marcin; Sawada, Joe; Sritharan, R.

Book ID: 122793890
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 230 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.01.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding Paths and Cycles of Superpolylog

Finding Paths and Cycles of Superpolylogarithmic Length

✍ Gabow, Harold N. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 288 KB

Polynomial Algorithms for Finding Cycles

Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments

✍ Manoussakis, Y.; Tuza, Z. 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 874 KB

An algorithm for finding hamilton paths

An algorithm for finding hamilton paths and cycles in random graphs

✍ B. Bollobás; T. I. Fenner; A. M. Frieze 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 666 KB

Long induced paths and cycles in Kneser

Long induced paths and cycles in Kneser graphs

✍ Peter Alles; Svatopluk Poljak 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 209 KB

Closures, cycles, and paths

✍ Jochen Harant; Arnfried Kemnitz; Akira Saito; Ingo Schiermeyer 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

## Abstract In 1960 Ore proved the following theorem: Let __G__ be a graph of order __n__. If __d__(__u__) + __d__(__v__)≥__n__ for every pair of nonadjacent vertices __u__ and __v__, then __G__ is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have

Fast algorithms for finding Hamiltonian

Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs

✍ Jørgen Bang-Jensen; Pavol Hell 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 332 KB