Pages that link to "Item:Q5937916"
From MaRDI portal
The following pages link to The hardness of intervalizing four colored caterpillars (Q5937916):
Displayed 8 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths (Q2146743) (← links)
- Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← links)
- The b-chromatic number of power graphs of complete caterpillars (Q3379157) (← links)
- The Proper Interval Colored Graph problem for caterpillar trees (Q3439122) (← links)
- On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
- Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)