The following pages link to Triangulating 3-Colored Graphs (Q4012447):
Displaying 17 items.
- Acyclic and star colorings of cographs (Q643025) (← links)
- Method of 3-colouring of graphs (Q1123201) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Three colorability characterized by shrinking of locally connected subgraphs into triangles (Q1708265) (← 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)
- Tiling tripartite graphs with 3-colorable graphs (Q2380267) (← links)
- Unique Perfect Phylogeny Is NP-Hard (Q3011849) (← links)
- (Q3514492) (← links)
- 4-Colored Triangulation of 3-Maps (Q4605339) (← links)
- Intervalizing k-colored graphs (Q4645169) (← links)
- (Q4683143) (← links)
- Triangulating Three-Colored Graphs in Linear Time and Linear Space (Q4695390) (← links)
- (Q4784290) (← links)
- (Q5743514) (← links)
- On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)