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 ...
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 ...
This is a preview. Log in through your library . Abstract We prove that the edge dominating set problem for graphs is NP-complete even when restricted to planar or bipartite graphs of maximum degree 3 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback