Pages that link to "Item:Q4296524"
From MaRDI portal
The following pages link to Triangulating Vertex-Colored Graphs (Q4296524):
Displaying 20 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- Tree reconstruction from multi-state characters (Q696854) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Trees, taxonomy, and strongly compatible multi-state characters (Q1364321) (← links)
- Recovering trees from well-separated multi-state characters. (Q1427476) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Quasi-median graphs from sets of partitions (Q1613411) (← links)
- On minimal vertex separators of dually chordal graphs: properties and characterizations (Q1759837) (← 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)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Unique Perfect Phylogeny Is NP-Hard (Q3011849) (← links)
- Intervalizing k-colored graphs (Q4645169) (← links)
- On the Generalised Character Compatibility Problem for Non-branching Character Trees (Q5323073) (← links)
- On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)
- Minimizing phylogenetic number to find good evolutionary trees (Q5961621) (← links)
