Binding number, minimum degree and bipancyclism in bipartite graphs
From MaRDI portal
Publication:5282775
Recommendations
Cites work
- A sufficient condition for Hamiltonians in balanced bipartite graphs
- An optimal binding number condition for bipancyclism
- Binding number, minimum degree, and cycle structure in graphs
- Graph theory with applications
- Hamilton cycles in 2-connected regular bipartite graphs
- The binding number of a graph and its Anderson number
- The binding number of a graph and its pancyclism
- Weakly bipancyclic bipartite graphs
Cited in
(8)- An optimal binding number condition for bipancyclism
- Bipancyclicism and bipanconnectivity in bipartite graphs
- Binding number, cycles, and cliques
- Transversals and bipancyclicity in bipartite graph families
- scientific article; zbMATH DE number 6119662 (Why is no real title available?)
- A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
- Cyclability and pancyclability in bipartite graphs
- Best monotone degree conditions for binding number and cycle structure
This page was built for publication: Binding number, minimum degree and bipancyclism in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282775)