Vertex-bipancyclicity in a bipartite graph collection
From MaRDI portal
Publication:6542013
DOI10.1016/j.disc.2024.113980zbMATH Open1539.05067MaRDI QIDQ6542013
Xue Liang Li, Luyi Li, Ningyan Xu, Jie Hu
Publication date: 21 May 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Transversal (matching) theory (05D15) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Extending cycles in graphs
- Hamilton connected graphs
- Rainbow pancyclicity in graph systems
- From one to many rainbow Hamiltonian cycles
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Pancyclic graphs. I
- On Hamiltonian bipartite graphs
- Transversals and bipancyclicity in bipartite graph families
- On a rainbow version of Dirac's theorem
- Bipartite graphs with cycles of all even lengths
- A rainbow version of Mantel's Theorem
- A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
- Some Theorems on Abstract Graphs
- Transversal factors and spanning trees
- Rainbow spanning structures in graph and hypergraph systems
- Rainbow structures in a collection of graphs with degree conditions
This page was built for publication: Vertex-bipancyclicity in a bipartite graph collection
