Pages that link to "Item:Q820152"
From MaRDI portal
The following pages link to Parameterized coloring problems on chordal graphs (Q820152):
Displaying 19 items.
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- A parameterized view on matroid optimization problems (Q1035682) (← links)
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS (Q2841989) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- (Q5075776) (← links)
- (Q5874519) (← links)
