Transversals and bipancyclicity in bipartite graph families

21 May 2020 Bradshaw Peter

A theorem of E. Schmeichel and J. Mitchem states that for $n \geq 4$, every balanced bipartite graph on $2n$ vertices in which each vertex in one color class has degree greater than $\frac{n}{2}$ and each vertex in the other color class has degree at least $\frac{n}{2}$ is bipancyclic. We prove a generalization of this theorem in the setting of graph transversals... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS