Abstract Forty years ago, Kleitman considered the numbers of crossings in good planar drawings of the complete bipartite graph ${K_{m,n}}$. Among other things, he ...
In this paper, we study the spectral radius of bipartite graphs. Let 𝐺 be a bipartite graph with 𝑒 edges without isolated vertices. It was known that the spectral radius of 𝐺 is at most the square ...
On the 27th of September 2024, M.Sc. Juha Harvainen defends his PhD thesis on Advances in Sampling and Counting Bipartite Matchings and Directed Acyclic Graphs. The thesis is related to research done ...
A drawing of a graph G in the plane has the vertices represented by distinct points and the edges represented by polygonal lines joining their endpoints such that: no edge contains a vertex other than ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback