Decycling hypercubes
From MaRDI portal
Publication:1423502
DOI10.1007/s00373-003-0529-9zbMath1032.05071OpenAlexW4253960404MaRDI QIDQ1423502
Publication date: 4 March 2004
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-003-0529-9
Related Items (12)
Unnamed Item ⋮ The decycling number of $P_{m} \square P_{n}^{\ast}$ ⋮ Decycling bipartite graphs ⋮ New bounds on the decycling number of generalized de Bruijn digraphs ⋮ Induced forests in some distance-regular graphs ⋮ Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs ⋮ On the decycling number of generalized Kautz digraphs ⋮ A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ ⋮ The k-conversion number of regular graphs ⋮ Minimum feedback vertex sets in shuffle-based interconnection networks ⋮ Cycle intersection graphs and minimum decycling sets of even graphs ⋮ Feedback vertex number of Sierpiński-type graphs
This page was built for publication: Decycling hypercubes
