Pages that link to "Item:Q5311095"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311095):
Displaying 11 items.
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs (Q2220774) (← links)
- Equitable list tree-coloring of bounded treewidth graphs (Q2220879) (← links)
- Tree-coloring problems of bounded treewidth graphs (Q2292136) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Monadic Second Order Logic on Graphs with Local Cardinality Constraints (Q3599161) (← links)
- (Q4636249) (← links)
- (Q5257573) (← links)