✦ LIBER ✦

Breaking the Symmetries of the Book Graph and the Generalized Petersen Graph

✍ Scribed by Lal, A. K.; Bhattacharjya, B.

Book ID: 118197041
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 338 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/080728640

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The generalized Petersen graph G(24, 5)

✍ H.S.M. Coxeter 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 188 KB

-ordered-Hamiltonian problems of the gen

-ordered-Hamiltonian problems of the generalized Petersen graph

✍ Chun-Nan Hung; David Lu; Randy Jia; Cheng-Kuan Lin; László Lipták; Eddie Cheng; 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 962 KB

Supereulerian Graphs and the Petersen Gr

Supereulerian Graphs and the Petersen Graph

✍ Paul A. Catlin; Hong-Jian Lai 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 619 KB

Any 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph.

The classification of hamiltonian genera

The classification of hamiltonian generalized Petersen graphs

✍ Brian Alspach 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 689 KB

The isomorphism classes of the generaliz

The isomorphism classes of the generalized Petersen graphs

✍ Alice Steimle; William Staton 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 416 KB

On the 2-extendability of the generalize

On the 2-extendability of the generalized Petersen graphs

✍ Gerald Schrag; Larry Cammack 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 731 KB

A graph G is n-extendable if it is connected, contains a set of rr independent edges and every set of n-independent edges extends to (i.e. is a subset of) a perfect matching. Combining the results of this and previous papers we answer the question of 2-extendability for all the generalized Petersen