Cyclability and pancyclability in bipartite graphs
From MaRDI portal
Publication:5959085
DOI10.1016/S0012-365X(00)00425-8zbMath0998.05037OpenAlexW2081553886WikidataQ126572892 ScholiaQ126572892MaRDI QIDQ5959085
Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Denise Amar
Publication date: 30 July 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00425-8
Related Items
A \(k\)-tree containing specified vertices ⋮ Partial degree conditions and cycle coverings in bipartite graphs ⋮ Disjoint cycles covering specified vertices in bipartite graphs with partial degrees ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ A look at cycles containing specified elements of a graph
This page was built for publication: Cyclability and pancyclability in bipartite graphs