Decycling bubble sort graphs
From MaRDI portal
Recommendations
- Decycling graphs
- The \((n,k)\)-bubble sort graphs
- scientific article; zbMATH DE number 2186982
- Decycling bipartite graphs
- One conjecture of bubble-sort graphs
- scientific article; zbMATH DE number 3928360
- Decycling connected regular graphs
- Conditional matching preclusion for bubble sort graphs
- A note on Hamiltonian decomposition of bubble-sort graphs
- scientific article; zbMATH DE number 1744105
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 1744105 (Why is no real title available?)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Decycling graphs
- Feedback vertex set in hypercubes
- Feedback vertex sets in star graphs
- Maximum induced trees in graphs
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
- On the bounds of feedback numbers of \((n,k)\)-star graphs
- Reducibility among combinatorial problems
Cited in
(4)
This page was built for publication: Decycling bubble sort graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494444)