The following pages link to (Q4952178):
Displaying 11 items.
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) (← links)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion (Q1028139) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- Feedback vertex set on Hamiltonian graphs (Q2672436) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← 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)
