The decycling number of $P_{m} \square P_{n}^{\ast}$
From MaRDI portal
Publication:2920881
DOI10.1142/S1793830914500335zbMath1298.05178OpenAlexW2131784590MaRDI QIDQ2920881
Chie-Huai Shih, Min-Yun Lien, Hung-Lin Fu
Publication date: 29 September 2014
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830914500335
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Feedback vertex set in hypercubes
- Feedback numbers of Kautz digraphs
- Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
- Feedback numbers of de Bruijn digraphs
- Feedback vertex sets in star graphs
- Almost exact minimum feedback vertex set in meshes and butterflies
- On the feedback vertex set problem in permutation graphs
- Decycling hypercubes
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
- Decycling graphs
- Minimal feedback vertex sets in directed split‐stars
- Decycling Cartesian Products of Two Cycles
This page was built for publication: The decycling number of $P_{m} \square P_{n}^{\ast}$