Pages that link to "Item:Q1199467"
From MaRDI portal
The following pages link to Generalized vertex covering in interval graphs (Q1199467):
Displaying 5 items.
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
