Michael C. Wigal

collaborators

3 papers

math.CO2020

Large cycles in essentially 4-connected graphs

Michael Wigal, Xingxing Yu

Tutte proved that every 4-connected planar graph contains a Hamilton cycle, but there are 3-connected $n$ -vertex planar graphs whose longest cycles have length $Θ (n^{l o g_{3} 2})$ . On…

math.CO2017

Online coloring a token graph

Kevin G. Milans, Michael C. Wigal

We study a combinatorial coloring game between two players, Spoiler and Algorithm, who alternate turns. First, Spoiler places a new token at a vertex in $G$ , and Algorithm responds…

math.CO2017

Ordered multiplicity inverse eigenvalue problem for graphs on six vertices

John Ahn, Christine Alar, Beth Bjorkman +6

For a graph $G$ , we associate a family of real symmetric matrices, $S (G)$ , where for any $M \in S (G)$ , the location of the nonzero off-diagonal entries of $M$ a…