4 papers · 2 filters
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…
On Sums, Derivatives, and Flips of Riordan Arrays
Caroline Bang, Matias von Bell, Eric Culver +4
We study three operations on Riordan arrays. First, we investigate when the sum of Riordan arrays yields another Riordan array. We characterize the - and -sequences of these…
Relation between the correspondence chromatic number and the Alon--Tarsi number
Eric Culver, Stephen Hartke
We study the relation between the correspondence chromatic number and the Alon--Tarsi number, both upper bounds on the list chromatic number of a graph. There are many graphs with…
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…