Pages that link to "Item:Q5458558"
From MaRDI portal
The following pages link to On 2-Subcolourings of Chordal Graphs (Q5458558):
Displaying 7 items.
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- On Efficient Coloring of Chordless Graphs (Q4931915) (← links)
- (Q5009615) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)