The following pages link to Decycling graphs (Q4337506):
Displaying 44 items.
- A feedback vertex set of 2-degenerate graphs (Q300250) (← 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)
- A simple proof of an inequality connecting the alternating number of independent sets and the decycling number (Q539877) (← links)
- An intermediate value theorem for the decycling numbers of Toeplitz graphs (Q897228) (← links)
- Feedback numbers of de Bruijn digraphs (Q980262) (← links)
- Minimum feedback vertex sets in shuffle-based interconnection networks (Q1007599) (← 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)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- The cyclomatic number of a graph and its independence polynomial at \(- 1\) (Q1950412) (← links)
- The decycling number of outerplanar graphs (Q1956257) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs (Q2131857) (← links)
- Nonseparating independent sets and maximum genus of graphs (Q2155662) (← 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)
- Minimal contagious sets in random regular graphs (Q2350108) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- Twins in graphs (Q2441959) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- Decycling with a matching (Q2628271) (← links)
- Maximum induced forests of product graphs (Q2683145) (← links)
- The decycling number of $P_{m} \square P_{n}^{\ast}$ (Q2920881) (← links)
- New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
- Acyclic sum-list-colouring of grids and other classes of graphs (Q4690984) (← links)
- The <i>k</i>-conversion number of regular graphs (Q4956206) (← links)
- Cycle intersection graphs and minimum decycling sets of even graphs (Q4965894) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- Decycling bipartite graphs (Q5084689) (← links)
- A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
- (Q5197598) (← links)
- (Q5708559) (← links)
- (Q5708613) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)
- Spin Glass approach to the feedback vertex set problem (Q6176705) (← links)
