Pages that link to "Item:Q5470785"
From MaRDI portal
The following pages link to Decycling Cartesian Products of Two Cycles (Q5470785):
Displayed 17 items.
- On non-progressive spread of influence through social networks (Q401306) (← links)
- Triggering cascades on strongly connected directed graphs (Q500995) (← links)
- Connectivity of Cartesian products of graphs (Q998569) (← links)
- New formulae for the decycling number of graphs (Q1630929) (← links)
- A note on decycling number, vertex partition and AVD-total coloring in graphs (Q1756100) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) (← links)
- Target set selection on generalized pancake graphs (Q2195642) (← links)
- Acyclic sum-list-colouring of cylinders (Q2244713) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Nonseparating independent sets of Cartesian product graphs (Q2300678) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- Maximum induced forests of product graphs (Q2683145) (← links)
- The decycling number of $P_{m} \square P_{n}^{\ast}$ (Q2920881) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)