Bipartite graphs containing every possible pair of cycles

DOI10.1016/S0012-365X(99)00047-3zbMATH Open0936.05064OpenAlexW2077018265MaRDI QIDQ1817575

Hong Wang

Publication date: 8 May 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00047-3

zbMATH Keywords

bipartite graphvertex-disjoint cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (2)

EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K_2,n ⋮ Digraphs containing every possible pair of dicycles

This page was built for publication: Bipartite graphs containing every possible pair of cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817575)