Pages that link to "Item:Q1739097"
From MaRDI portal
The following pages link to Independent feedback vertex set for \(P_5\)-free graphs (Q1739097):
Displaying 19 items.
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- (Q5874489) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
- Sparsity in covering solutions (Q6547950) (← links)
- Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)
- Independent transversals versus transversals (Q6621186) (← links)
