Anna Gujgiczer

Orcid: 0009-0000-9676-5451

According to our database¹, Anna Gujgiczer authored at least 7 papers between 2022 and 2026.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

Generalizing Brooks' Theorem via Partial Coloring Is Hard Classically and Locally.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2026

2025

On graph classes with constant domination-packing ratio.

[BibT_eX]

[DOI]

CoRR, March, 2025

2024

Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number.

[BibT_eX]

[DOI]

Anna Gujgiczer

Gábor Simonyi

Graphs Comb., May, 2024

2023

Structured Codes of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2023

Winding number and circular 4-coloring of signed graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2022

On multichromatic numbers of widely colorable graphs.

[BibT_eX]

[DOI]

Anna Gujgiczer

Gábor Simonyi

J. Graph Theory, 2022

Codes with structured Hamming distance in graph families.

[BibT_eX]

[DOI]

Anna Gujgiczer

János Körner

Gábor Simonyi

CoRR, 2022

Anna Gujgiczer

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...