✦ LIBER ✦

Recognizing Recursive Circulant Graphs (Extended Abstract)

✍ Scribed by Guillaume Fertin; André Raspaud

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 285 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80139-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pancyclicity of recursive circulant grap

Pancyclicity of recursive circulant graphs

✍ Toru Araki; Yukio Shibata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 96 KB

In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.

Disjoint Hamiltonian cycles in recursive

Disjoint Hamiltonian cycles in recursive circulant graphs

✍ C. Micheneau 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 499 KB

We show in this paper that the circulant graph G( 2"', 4) is Hamiltonian decomposable, and propose a recursive construction method. This is a partial answer to a problem posed by B. Alspach. @

Erratum to “Pancyclicity of recursive ci

Erratum to “Pancyclicity of recursive circulant graphs”: [Inform. Process. Lett. 81 (2002) 187–190]

✍ Tom Araki; Yukio Shibata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 19 KB

Bialgebraic Semantics and Recursion: (Ex

Bialgebraic Semantics and Recursion: (Extended Abstract)

✍ Gordon Plotkin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 85 KB

Typed Closure Conversion for Recursively

Typed Closure Conversion for Recursively-Defined Functions: Extended Abstract

✍ Greg Morrisett; Robert Harper 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 535 KB

Influence Digraphs Induced by Time-Stamp

Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract)

✍ Eddie Cheng; Jerrold W. Grossman; Marc J. Lipman 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 520 KB