Transversals and bipancyclicity in bipartite graph families

DOI10.37236/9489zbMath1478.05087arXiv2002.10014OpenAlexW3216687008MaRDI QIDQ2665966

Peter Bradshaw

Publication date: 22 November 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.10014

zbMATH Keywords

vertex degreesbalanced bipartite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (2)

Rainbow structures in a collection of graphs with degree conditions ⋮ From one to many rainbow Hamiltonian cycles

Cites Work

• New sufficient conditions for cycles in graphs
• On Ore-type sufficient condition for a bipancyclic ordering
• Rainbow pancyclicity in graph systems
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Pancyclic graphs. I
• On Hamilton's ideals
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• On a rainbow version of Dirac's theorem
• A General Criterion for the Existence of Transversals
• Bipartite graphs with cycles of all even lengths
• A rainbow version of Mantel's Theorem
• On sets of almost disjoint subsets of a set
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Transversals and bipancyclicity in bipartite graph families