Pages that link to "Item:Q1923585"
From MaRDI portal
The following pages link to The complexity of generalized graph colorings (Q1923585):
Displaying 10 items.
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- (Q4824884) (← links)
- Generalized Coloring of Permutations (Q5009614) (← links)
- Harary polynomials (Q5056203) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Generalized coloring of permutations (Q6582372) (← links)
