Pages that link to "Item:Q5851101"
From MaRDI portal
The following pages link to Connected Feedback Vertex Set in Planar Graphs (Q5851101):
Displaying 13 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- The price of connectivity for feedback vertex set (Q516802) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Connecting face hitting sets in planar graphs (Q1944026) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- The Price of Connectivity for Cycle Transversals (Q2946410) (← links)
- (Q5005166) (← links)
- (Q5075825) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
