Pages that link to "Item:Q3439122"
From MaRDI portal
The following pages link to The Proper Interval Colored Graph problem for caterpillar trees (Q3439122):
Displaying 10 items.
- Proper interval graph extention problems of the complements of trees (Q547547) (← links)
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← 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)
- Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion (Q3058695) (← links)
- On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
- Interval edge-coloring of caterpillars with hairs of arbitrary length (Q3971918) (← links)
- The hardness of intervalizing four colored caterpillars (Q5937916) (← links)