Feedback numbers of Kautz digraphs
From MaRDI portal
Publication:879335
DOI10.1016/J.DISC.2006.09.010zbMATH Open1119.05052OpenAlexW2124463034MaRDI QIDQ879335FDOQ879335
Authors: Jun-Ming Xu, Yezhou Wu, Jia Huang, Chao Yang 
Publication date: 11 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.010
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Title not available (Why is that?)
- On the feedback vertex set problem in permutation graphs
- Almost exact minimum feedback vertex set in meshes and butterflies
- Feedback vertex set in hypercubes
- Feedback vertex sets and cyclically reducible graphs
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Minimum feedback vertex sets in shuffle-based interconnection networks
- Minimal feedback vertex sets in directed split‐stars
- The Lattice Point Covering Theorem for Rectangles
- Decycling cubes and grids
Cited In (8)
- The decycling number of \(P_m\square P^\ast_n\)
- Title not available (Why is that?)
- Feedback numbers of Kautz undirected graphs
- New bounds on the decycling number of generalized de Bruijn digraphs
- On the decycling number of generalized Kautz 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)
