Anna Gujgiczer

activity

20212026

collaborators

8 papers

math.CO2026

Cover numbers by graph families bounded by certain graph parameters

Anna Gujgiczer, Márton Marits, Kenta Ozeki

The cover number of a graph by a graph class $P$ is the least number of $P$ -graphs necessary to cover its edges. A classical theorem of Harary, Hsu and Miller giv…

math.CO2026

Domination and packing in graphs

Ákos Dúcz, Anna Gujgiczer

The dominating number $γ (G)$ of a graph $G$ is the minimum size of a vertex set whose closed neighborhoods cover all vertices of $G$ , while the packing number $ρ (G)$ is the maximum…

cs.DC2025

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{ $k$ -partial $c$ -coloring} where $c = k$ , a natural generalization of Brooks' theorem where each vertex should be colo…

math.CO2025

On graph classes with constant domination-packing ratio

Marthe Bonamy, Mónika Csikós, Anna Gujgiczer +1

The dominating number $γ (G)$ of a graph $G$ is the minimum size of a vertex set whose closed neighborhood covers all the vertices of the graph. The packing number $ρ (G)$ of $G$ is…

math.CO2023

Winding number and circular 4-coloring of signed graphs

Anna Gujgiczer, Reza Naserasr, Rohini S +1

Concerning the recent notion of circular chromatic number of signed graphs, for each given integer $k$ we introduce two signed bipartite graphs, each on $2 k^{2} - k + 1$ vertices, having…

math.CO2022

Critical subgraphs of Schrijver graphs for the fractional chromatic number

Anna Gujgiczer, Gábor Simonyi

Schrijver graphs are vertex-color-critical subgraphs of Kneser graphs having the same chromatic number. They also share the value of their fractional chromatic number but Schrijver…

math.CO2022

Structured Codes of Graphs

Noga Alon, Anna Gujgiczer, János Körner +2

We investigate the maximum size of graph families on a common vertex set of cardinality $n$ such that the symmetric difference of the edge sets of any two members of the family sat…

math.CO2021

On multichromatic numbers of widely colorable graphs

Anna Gujgiczer, Gábor Simonyi

A coloring is called $s$ -wide if no walk of length $2 s - 1$ connects vertices of the same color. A graph is $s$ -widely colorable with $t$ colors if and only if it admits a homomorphi…