https://arxiv.org/abs/2511.12781
Abstract page for arXiv paper 2511.12781: Separating path systems for cubic graphs and for complete bipartite graphs
cubic graphsseparatingpathsystems
https://www.semanticscholar.org/topic/Bipartite-dimension/1126983
In the mathematical fields of graph theory and combinatorial optimization, the bipartite dimension or biclique cover number of a graph G = (V, E) is the...
bipartite dimensionsemantic scholar
https://scirp.org/journal/paperinformation?paperid=128088
Cycle multiplicity of a graph G is the maximum number of edge disjoint cycles in G. In this paper, we determine the cycle multiplicity of and then obtain the...
total graphcyclemultiplicitycompletebipartite
https://deepai.org/publication/online-bipartite-matching-with-advice-tight-robustness-consistency-tradeoffs-for-the-two-stage-model
06/22/22 - We study the two-stage vertex-weighted online bipartite matching problem of Feng, Niazadeh, and Saberi (SODA 2021) in a setting wh...
online bipartite matchingadvicetightrobustnessconsistency
https://www.mdpi.com/2073-8994/12/2/311
In this paper, we consider the eigenproblems for Latin squares in a bipartite min-max-plus system. The focus is upon developing a new algorithm to compute the...
efficient algorithmeigenvalue problemlatin squares
https://www.arxiv.org/abs/1712.09989
Abstract page for arXiv paper 1712.09989: The genus of a random bipartite graph
bipartite graphgenusrandom