Pages that link to "Item:Q4695390"
From MaRDI portal
The following pages link to Triangulating Three-Colored Graphs in Linear Time and Linear Space (Q4695390):
Displaying 9 items.
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← 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)
- A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs (Q3141527) (← links)
- Three-coloring triangle-free planar graphs in linear time (Q3189025) (← links)
- Intervalizing k-colored graphs (Q4645169) (← links)
- (Q4784290) (← links)
- On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)