52 citations · 81 across the 8 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
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…
cs.CC2014★ 1 cited
On the tractability of some natural packing, covering and partitioning problems
Attila Bernáth, Zoltán Király
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an…