2 citations · 4 across the 5 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
A New [Combinatorial] Proof of the Commutativity of Matching Polynomials for Cycles
Garner Cochran, Corbin Groothuis, Andrew Herring +2
We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the -matching polynomial of a cycle graph. A matching in a (finite…
math.CO2018
A Size Condition for Diameter Two Orientable Graphs
Garner Cochran, Éva Czabarka, Peter Dankelmann +1
It was conjectured by Koh and Tay [Graphs Combin. 18(4) (2002), 745--756] that for every simple graph of order and size at least has an orientation…
math.CO2018★ 2 cited
Using Block Designs in Crossing Number Bounds
John Asplund, Eva Czabarka, Gregory Clark +6
The crossing number ${\mbox {cr}}(G)$ of a graph is the smallest number of edge crossings over all drawings of in the plane. For any , the -planar crossing…