The following pages link to Intervalizing k-colored graphs (Q4645169):
Displaying 14 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Bounded degree interval sandwich problems (Q1293876) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Interval vertex-coloring of a graph with forbidden colors (Q1823960) (← links)
- Coloring interval graphs with First-Fit (Q1898342) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- Coloring \(k\)-colorable graphs using smaller palettes (Q2768312) (← links)
- Interval non-total colorable graphs (Q2797366) (← links)
- Exact Algorithms for Intervalizing Colored Graphs (Q2999332) (← links)
- SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
- The Proper Interval Colored Graph problem for caterpillar trees (Q3439122) (← links)
- On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
- (Q4471379) (← links)
- The hardness of intervalizing four colored caterpillars (Q5937916) (← links)