Pages that link to "Item:Q5918178"
From MaRDI portal
The following pages link to On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178):
Displaying 14 items.
- The price of connectivity for cycle transversals (Q739064) (← links)
- Computing weighted subset transversals in \(H\)-free graphs (Q832863) (← links)
- On a cycle through a specified linear forest of a graph (Q868359) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Cycle transversals in perfect graphs and cographs (Q1935798) (← links)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Classifying subset feedback vertex set for \(H\)-free graphs (Q6549683) (← links)
- Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
- Connected feedback vertex set on AT-free graphs (Q6658085) (← links)
