The following pages link to (Q4529530):
Displayed 25 items.
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- On the bounds of feedback numbers of \((n,k)\)-star graphs (Q436576) (← links)
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
- The decycling number of generalized Petersen graphs (Q479058) (← links)
- Decycling bubble sort graphs (Q494444) (← links)
- An intermediate value theorem for the decycling numbers of Toeplitz graphs (Q897228) (← links)
- Feedback numbers of de Bruijn digraphs (Q980262) (← links)
- New formulae for the decycling number of graphs (Q1630929) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- Target set selection on generalized pancake graphs (Q2195642) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Tree-core and tree-coritivity of graphs (Q2348704) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- Feedback vertex sets in cubic multigraphs (Q2515555) (← links)
- Decycling with a matching (Q2628271) (← links)
- Feedback vertex number of Sierpiński-type graphs (Q3299375) (← links)
- New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
- Cycle intersection graphs and minimum decycling sets of even graphs (Q4965894) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- Decycling bipartite graphs (Q5084689) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- Domination number and feedback vertex number of complements of line graphs (Q6101458) (← links)