52 citations · 81 across the 8 of their papers we have counts for
11 papers
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…
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…
Network Coding Algorithms for Multi-Layered Video Broadcast
Erika R. Bérczi-Kovács, Zoltán Király
In this paper we give network coding algorithms for multi-layered video streaming. The problem is motivated by video broadcasting in a communication network to users with varying d…
Spanning tree with lower bound on the degrees
Zoltán Király
We concentrate on some recent results of Egawa and Ozeki [J. Graph Theory, 2015 and Combinatorica, 2014], and He et al. [J. Graph Theory, 2002]. We give shorter proofs and polynomi…
On Ryser's conjecture for t-intersecting and degree-bounded hypergraphs
Zoltan Kiraly, Lilla Tothmeresz
A famous conjecture (usually called Ryser's conjecture) that appeared in the Ph.D thesis of his student, J.~R.~Henderson [15], states that for an -uniform -partite hypergraph…
Covering complete partite hypergraphs by monochromatic components
András Gyárfás, Zoltán Király
A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formu…