Zalán Molnár

Orcid: 0000-0002-4391-246X

According to our database1, Zalán Molnár authored at least 4 papers between 2024 and 2026.

Collaborative distances:
  • Dijkstra number2 of seven.
  • Erdős number3 of six.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Ultrafilter Extensions of Bounded Graphs are Elementary.
Stud Logica, April, 2026

2025
Upper Bounds for the List-Distinguishing Chromatic Number.
Graphs Comb., June, 2025

Brooks' type theorems for coloring parameters of locally finite graphs and Kőnig's Lemma.
Ars Math. Contemp., 2025

2024
Distinguishing colorings, proper colorings, and covering properties without AC.
Ars Math. Contemp., 2024


  Loading...