Pages that link to "Item:Q3141527"
From MaRDI portal
The following pages link to A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs (Q3141527):
Displaying 13 items.
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← 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)
- Three-coloring triangle-free planar graphs in linear time (Q3189025) (← links)
- Intervalizing k-colored graphs (Q4645169) (← links)
- Triangulating Three-Colored Graphs in Linear Time and Linear Space (Q4695390) (← links)
- (Q4784290) (← links)
- Two strikes against perfect phylogeny (Q5204323) (← links)
- On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)
- Dynamic algorithms for graphs with treewidth 2 (Q6143969) (← links)