The following pages link to Michael C. Wigal (Q2091106):
Displayed 10 items.
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- Tutte paths and long cycles in circuit graphs (Q2099420) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Online coloring a token graph (Q2303438) (← links)
- A Dichotomy Theorem for First-Fit Chain Partitions (Q5218437) (← links)
- Sampling planar tanglegrams and pairs of disjoint triangulations (Q6107829) (← links)
- Large cycles in essentially 4-connected graphs (Q6337171) (← links)
- On Tutte cycles containing three prescribed edges (Q6370570) (← links)
- Approximating TSP walks in subcubic graphs (Q6385429) (← links)
- Improving Uniquely Decodable Codes in Binary Adder Channels (Q6464142) (← links)