Pages that link to "Item:Q5902531"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902531):
Displaying 10 items.
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
- (Q5111880) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
