Pages that link to "Item:Q1029080"
From MaRDI portal
The following pages link to Feedback vertex sets in star graphs (Q1029080):
Displaying 23 items.
- Feedback vertex set in hypercubes (Q294845) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← 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 efficient algorithm for minimum feedback vertex sets in rotator graphs (Q987789) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- Feedback vertex set on planar graphs (Q1936089) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- Feedback vertex set on Hamiltonian graphs (Q2672436) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- The decycling number of \(P_m\square P^\ast_n\) (Q2920881) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Feedback vertex number of Sierpiński-type graphs (Q3299375) (← links)
- Feedback Vertex Sets in Rotator Graphs (Q3603042) (← links)
- On feedback vertex sets and nonseparating independent sets in cubic graphs (Q3804730) (← links)
- New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
- MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS (Q4902886) (← links)
- Decycling bipartite graphs (Q5084689) (← links)
- (Q5173696) (← links)
