4 citations · 5 across the 13 of their papers we have counts for
4 papers · 1 filter
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…
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…
A degree condition for diameter two orientability of graphs
Éva Czabarka, Peter Dankelmann, László A. Székely
For let be the smallest value such that every graph of order and minimum degree at least admits an orientation of diameter two. We show that $δ_n…
Inducibility of d-ary trees
Éva Czabarka, Audace A. V. Dossou-Olory, László A. Székely +1
Imitating a recently introduced invariant of trees, we initiate the study of the inducibility of -ary trees (rooted trees whose vertex outdegrees are bounded from above by $d\ge…