An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences
type: Item
instance of: scholarly article
title: An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences
zbMATH Open document ID: 1462.05340
published in: Theory and Applications of Graphs
publication date: 2021-04-28T00:00:00Z
full work available at URL: https://arxiv.org/abs/1908.06821
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 7341077
zbMATH Keywords: graphical degree sequence
zbMATH Keywords: bipartite realization
MaRDI profile type: Publication
OpenAlex ID: W3138955544
arXiv ID: 1908.06821
DOI: 10.20429/TAG.2021.080103
description: scientific article; zbMATH DE number 7341077