Disjoint cycles through prescribed vertices in multidimensional tori
From MaRDI portal
(Redirected from Publication:5036301)
Recommendations
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
- A note on the spanning cyclability of graphs
- On the cyclability of graphs
- On the 2-spanning cyclability of honeycomb toroidal graphs
Cites work
- A look at cycles containing specified elements of a graph
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- Hamiltonian cycles in the cartesian product of a tree and a cycle
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- On the maximal number of independent circuits in a graph
- Recent advances on the Hamiltonian problem: survey III
- Regular connected bipancyclic spanning subgraphs of hypercubes
- Two‐factors each component of which contains a specified vertex
- Vertex‐disjoint cycles containing prescribed vertices
Cited in
(5)
This page was built for publication: Disjoint cycles through prescribed vertices in multidimensional tori
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036301)