The following pages link to (Q5387684):
Displaying 9 items.
- First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Supernovae and cosmology (Q2481658) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
