Michael C. Wigal

Orcid: 0000-0002-9075-6914

According to our database1, Michael C. Wigal authored at least 11 papers between 2020 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
1
2
4
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
On Tutte Cycles Containing Three Prescribed Edges.
Graphs Comb., February, 2025

2024
Hardness and approximation of submodular minimum linear ordering problems.
Math. Program., November, 2024

The Cordiality Game and the Game Cordiality Number.
Graphs Comb., August, 2024

2023
Tutte paths and even covers.
PhD thesis, 2023

Approximating TSP walks in subcubic graphs.
J. Comb. Theory B, 2023

Tutte paths and long cycles in circuit graphs.
J. Comb. Theory B, 2023

Improving Uniquely Decodable Codes in Binary Adder Channels.
CoRR, 2023

Sampling planar tanglegrams and pairs of disjoint triangulations.
Adv. Appl. Math., 2023

2022
Algorithms for maximum internal spanning tree problem for some graph classes.
J. Comb. Optim., 2022

2020
A Dichotomy Theorem for First-Fit Chain Partitions.
SIAM J. Discret. Math., 2020

Online Coloring a Token Graph.
Graphs Comb., 2020


  Loading...