From the 1 of 4 linked papers with an AI index.
4 papers
Cover numbers by graph families bounded by certain graph parameters
Anna Gujgiczer, Márton Marits, Kenta Ozeki
The paper studies how many graphs from a family with bounded fractional or local chromatic number are needed to cover the edges of a given graph, proving that the classic exact for…
Domination and packing in graphs
Ãkos Dúcz, Anna Gujgiczer
The dominating number of a graph is the minimum size of a vertex set whose closed neighborhoods cover all vertices of , while the packing number is the maxim…
Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
Jan Bok, Avinandan Das, Anna Gujgiczer +1
We investigate the classical and distributed complexity of \emph{-partial -coloring} where , a natural generalization of Brooks' theorem where each vertex should be colo…
On graph classes with constant domination-packing ratio
Marthe Bonamy, Mónika Csikós, Anna Gujgiczer +1
The dominating number of a graph is the minimum size of a vertex set whose closed neighborhood covers all the vertices of the graph. The packing number of i…