2-spanning cyclability problems of some generalized Petersen graphs
From MaRDI portal
Publication:2175232
DOI10.7151/dmgt.2150zbMath1437.05119OpenAlexW2887876035WikidataQ129414442 ScholiaQ129414442MaRDI QIDQ2175232
Chun-Nan Hung, Meng-Chien Yang, Eddie Cheng, Lih-Hsing Hsu
Publication date: 28 April 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2150
Related Items (2)
Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle ⋮ The spanning cyclability of Cayley graphs generated by transposition trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution to an open problem on 4-ordered Hamiltonian graphs
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- Paley graphs have Hamilton decompositions
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- On the Hamilton connectivity of generalized Petersen graphs
- The classification of Hamiltonian generalized Petersen graphs
- Hamiltonian decompositions of Cayley graphs on Abelian groups
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Hamiltonian decompositions of Cayley graphs on abelian groups of even order
- 4-ordered-Hamiltonian problems of the generalized Petersen graph image
- On spanning connected graphs
- On 3-regular 4-ordered graphs
- Pancyclic graphs. I
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- On the number of cycles of lengthk in a maximal planar graph
- Degree conditions for k‐ordered hamiltonian graphs
- k-ordered Hamiltonian graphs
- Variations on the Hamiltonian Theme
- Algorithms and Computation
- Survey of results on \(k\)-ordered graphs
This page was built for publication: 2-spanning cyclability problems of some generalized Petersen graphs