Pages that link to "Item:Q5084675"
From MaRDI portal
The following pages link to The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675):
Displaying 13 items.
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316) (← links)
- Improved Inapproximability Results for Maximum k-Colorable Subgraph (Q3638876) (← links)
- (Q4947488) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength (Q6132556) (← links)