Pages that link to "Item:Q1108038"
From MaRDI portal
The following pages link to The maximum k-colorable subgraph problem for chordal graphs (Q1108038):
Displaying 18 items.
- Heterogeneous Multi-resource Allocation with Subset Demand Requests (Q5057984) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5891098) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5920327) (← links)
- Maximizing dominance in the plane and its applications (Q5925538) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength (Q6132556) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs (Q6140360) (← links)
- The optimal cost chromatic partition problem for trees and interval graphs (Q6550551) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
- On the parameterized complexity of interval scheduling with eligible machine sets (Q6564614) (← links)
