Decycling Cartesian Products of Two Cycles
From MaRDI portal
Publication:5470785
DOI10.1137/S089548010444016XzbMath1096.05030MaRDI QIDQ5470785
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)
Related Items (17)
New formulae for the decycling number of graphs ⋮ The decycling number of $P_{m} \square P_{n}^{\ast}$ ⋮ A new formula for the decycling number of regular graphs ⋮ On non-progressive spread of influence through social networks ⋮ Maximum induced forests of product graphs ⋮ Target set selection on generalized pancake graphs ⋮ Triggering cascades on undirected connected graphs ⋮ On reversible cascades in scale-free and Erdős-Rényi random graphs ⋮ Triggering cascades on strongly connected directed graphs ⋮ Acyclic sum-list-colouring of cylinders ⋮ Acyclic polynomials of graphs ⋮ A note on decycling number, vertex partition and AVD-total coloring in graphs ⋮ A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ ⋮ Connectivity of Cartesian products of graphs ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles ⋮ Nonseparating independent sets of Cartesian product graphs
This page was built for publication: Decycling Cartesian Products of Two Cycles
