Recommendations
Cites work
- scientific article; zbMATH DE number 6118220 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Almost exact minimum feedback vertex set in meshes and butterflies
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Decycling cubes and grids
- Feedback vertex set in hypercubes
- Feedback vertex sets and cyclically reducible graphs
- Minimal feedback vertex sets in directed split‐stars
- Minimum feedback vertex sets in shuffle-based interconnection networks
- On the feedback vertex set problem in permutation graphs
- The Lattice Point Covering Theorem for Rectangles
Cited in
(8)- The decycling number of \(P_m\square P^\ast_n\)
- scientific article; zbMATH DE number 6403923 (Why is no real title available?)
- Feedback numbers of Kautz undirected graphs
- On the decycling number of generalized Kautz digraphs
- New bounds on the decycling number of generalized de Bruijn digraphs
- Feedback number of generalized Kautz digraphs \(\mathrm{GK}(2,n)\).
- Feedback numbers of de Bruijn digraphs
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles
This page was built for publication: Feedback numbers of Kautz digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879335)