AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS

DOI10.1142/S0129054101000588zbMath1320.05132OpenAlexW2138166588MaRDI QIDQ5249271

Wong, Pak-ken

Publication date: 30 April 2015

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

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

zbMATH Keywords

bipartite graphdistancedegreeHamiltonian cycleadjacency listeven pathunextendable vertex

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• New sufficient conditions for cycles in graphs
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES
• Updating the hamiltonian problem—A survey
• Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs

This page was built for publication: AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS