The following pages link to (Q3139747):
Displaying 11 items.
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces (Q1810157) (← links)
- Minimal reducible bounds for induced-hereditary properties (Q1883266) (← links)
- Parameterized (approximate) defective coloring (Q3304104) (← links)
- (Q4526476) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- Colorings of the Graph K ᵐ 2 + Kn (Q5859213) (← links)
- Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
