We add a fixed number of vertices of degree 1 to each vertex from one part of a bipartite graph. We study characteristic, matching and some related polynomials for graphs obtained in this way.

We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan and Weiss (2009). Customers and servers play symmetrical roles.There are finite sets C and S of ...

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 ...