Vertex-bipancyclicity in a bipartite graph collection
From MaRDI portal
(Redirected from Publication:6542013)
Recommendations
Cites work
- A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
- A rainbow version of Mantel's theorem
- Bipartite graphs with cycles of all even lengths
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Extending cycles in graphs
- From one to many rainbow Hamiltonian cycles
- Graph theory
- Hamilton connected graphs
- scientific article; zbMATH DE number 3455294 (Why is no real title available?)
- On a rainbow version of Dirac's theorem
- On Hamiltonian bipartite graphs
- Pancyclic graphs. I
- Rainbow matchings in r-partite r-graphs
- Rainbow pancyclicity in graph systems
- Rainbow spanning structures in graph and hypergraph systems
- Rainbow structures in a collection of graphs with degree conditions
- Some Theorems on Abstract Graphs
- Transversal factors and spanning trees
- Transversals and bipancyclicity in bipartite graph families
Cited in
(4)
This page was built for publication: Vertex-bipancyclicity in a bipartite graph collection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542013)