52 citations · 81 across the 8 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
How many matchings cover the nodes of a graph?
Dehia Ait Ferhat, Zoltán Király, András Sebő +1
Given an undirected graph, are there matchings whose union covers all of its nodes, that is, a matching--cover? A first, easy polynomial solution from matroid union is possi…
cs.CC2018
Acyclic orientations with degree constraints
Zoltán Király, Dömötör Pálvölgyi
In this note we study the complexity of some generalizations of the notion of -numbering. Suppose that given some functions and , we want to order the vertices of a grap…