Longest cycles in certain bipartite graphs

DOI10.1155/S0161171298000131zbMATH Open0890.05040OpenAlexW1983525229MaRDI QIDQ1380962FDOQ1380962

Authors: Wong, Pak-ken 

Publication date: 22 June 1998

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/47884

Recommendations

• scientific article; zbMATH DE number 3875321
• An algorithm for finding longest cycles in certain bipartite graphs
• scientific article; zbMATH DE number 4127251
• On long cycles in a 2-connected bipartite graph

zbMATH Keywords

bipartite graphbipartitioncycleHamiltonian graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cited In (13)

• Pancyclism and bipancyclism of Hamiltonian graphs
• Edge condition for long cycles in bipartite graphs
• An algorithm for finding longest cycles in certain bipartite graphs
• Long cycles in unbalanced bipartite graphs
• The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
• Determinants and Longest Cycles of Graphs
• Title not available (Why is that?)
• Lattice graphs with non-concurrent longest cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• A longest cycle version of Tutte's wheels theorem
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
• Title not available (Why is that?)

This page was built for publication: 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 Q1380962)