2 papers
math.CO2019
Entropy of Tournament Digraphs
David E. Brown, Eric Culver, Bryce Frederickson +2
The Rényi -entropy of complete antisymmetric directed graphs (i.e., tournaments) is explored. We optimize when and , and find that as increases 's…
math.CO2016
The chromatic number of the square of subcubic planar graphs
Stephen G. Hartke, Sogol Jahanbekam, Brent Thomas
Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most is -colorable. We prove this conjecture using the discharging method and computa…