AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES

DOI10.1142/S012905419600021XzbMath0867.68088OpenAlexW1967911775MaRDI QIDQ3126015

Wong, Pak-ken

Publication date: 23 March 1997

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905419600021x

zbMATH Keywords

bipartite graphHamiltonian cycle

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS

This page was built for publication: AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES