Pages that link to "Item:Q1923585"
From MaRDI portal
The following pages link to The complexity of generalized graph colorings (Q1923585):
Displaying 25 items.
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- The vertex coloring problem and its generalizations (Q1022440) (← links)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← 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)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- (Q3766875) (← links)
- Generalized colorings and avoidable orientations (Q4209941) (← links)
- (Q4249529) (← links)
- (Q4351066) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- (Q4824884) (← links)
- An Average Case NP-complete Graph Colouring Problem (Q4962593) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Generalized Coloring of Permutations (Q5009614) (← links)
- Harary polynomials (Q5056203) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Two generalizations of proper coloring: hardness and approximability (Q6168932) (← links)
- Complexity of total dominator coloring in graphs (Q6184152) (← links)
- Generalized coloring of permutations (Q6582372) (← links)
