An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences

Authors

Kai Wang, Georgia Southern UniversityFollow

Abstract

As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is presented to test whether an arbitrary graphical degree sequence has a bipartite realization. The algorithm can be configured to run in polynomial time, at the expense of possibly producing an erroneous output on some ``yes'' instances but with very low error rate.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Wang, Kai (2021) "An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences," Theory and Applications of Graphs: Vol. 8: Iss. 1, Article 3.
DOI: 10.20429/tag.2021.080103
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol8/iss1/3