3 papers
math.CO2022
Square of Planar Graphs of Max Degree Four without Five Cycles
Eric Culver, Stephen G. Hartke
We show that the choosability of the square of planar graphs of max degree 4 without five cycles is at most 12. Keywords: planar graph, choosability AMS Mathematics Subject Classif…
math.CO2022
Odd Covers of Graphs
Calum Buchanan, Alexander Clifton, Eric Culver +4
Given a finite simple graph , an odd cover of is a collection of complete bipartite graphs, or bicliques, in which each edge of appears in an odd number of bicliques and…
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…