Weakly bipancyclic bipartite graphs
DOI10.1016/J.DAM.2015.05.006zbMATH Open1319.05079OpenAlexW878432393MaRDI QIDQ494430FDOQ494430
Authors: Jing Sun, Zhiquan Hu 
Publication date: 1 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.006
Recommendations
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Weakly pancyclic graphs
- Hamilton cycles in regular 2-connected graphs
- Title not available (Why is that?)
- Hamilton cycles in 2-connected regular bipartite graphs
- Pancyclism in hamiltonian graphs
- Title not available (Why is that?)
- Hamilton cycles in claw-free graphs
- Hamiltonian pancyclic graphs
- An optimal binding number condition for bipancyclism
- Hamiltonian graphs involving neighborhood unions
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Weakly pancyclic graphs
- Title not available (Why is that?)
- Transversals and bipancyclicity in bipartite graph families
- Title not available (Why is that?)
- Weakly pancyclic graphs
- On bipartite graphs with weak density of some subgraphs
- Title not available (Why is that?)
- Binding number, minimum degree and bipancyclism in bipartite graphs
- Small bipancyclic graphs
- Title not available (Why is that?)
This page was built for publication: Weakly bipancyclic bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494430)
