The following pages link to (Q4063170):
Displaying 13 items.
- A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
- To be or not to be Yutsis: algorithms for the decision problem (Q709830) (← links)
- On the maximum induced forests of a connected cubic graph without triangles (Q757394) (← links)
- Induced forests in cubic graphs (Q791532) (← links)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (Q1003683) (← links)
- Some remarks on Jaeger's dual-hamiltonian conjecture (Q1296151) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs (Q2444564) (← links)
- To be or not to be Yutsis (Q3439167) (← links)
- The <i>k</i>-conversion number of regular graphs (Q4956206) (← links)
- A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
- (Q5197598) (← links)
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
