The following pages link to (Q4344207):
Displaying 11 items.
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- Channel assignment on graphs of bounded treewidth (Q1417576) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Systems of distant representatives (Q1764814) (← links)
- Partitioning chordal graphs into independent sets and cliques (Q1827861) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Extending upward planar graph drawings (Q5896867) (← links)
