An algorithm for finding longest cycles in certain bipartite graphs

DOI10.1142/S0129054101000588MaRDI QIDQ5249271zbMATH OpenOpenAlexFDO

Authors 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

adjacency listbipartite graphdegreedistanceeven pathHamiltonian cycleunextendable vertex

Mathematics Subject Classification ID

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

Recommendations

• AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES
• scientific article; zbMATH DE number 3935084
• Longest cycles in certain bipartite graphs
• scientific article; zbMATH DE number 4127251
• scientific article; zbMATH DE number 4112633

Cites work

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

Cited in

(6)

• Longest cycles in certain bipartite graphs
• AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES
• An algorithm for counting short cycles in bipartite graphs
• An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
• scientific article; zbMATH DE number 3952812 (Why is no real title available?)
• scientific article; zbMATH DE number 4025473 (Why is no real title available?)

This page was built for publication: An algorithm for finding longest cycles in certain bipartite graphs

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