3 citations · 3 across the 12 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
A coarse block-cut tree theorem
Júlia Baligács, Václav Blažej, Jadwiga Czyżewska +2
We prove a coarse analogue of the classic fact that every graph can be decomposed along its cut-vertices into -connected components. Precisely, we prove that for every graph …
math.CO2025
Symmetry classes of Hamiltonian cycles
Julia Baligacs, Sofia Brenner, Annette Lutz +1
We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs…
math.CO2024
The metric Menger problem
Júlia Baligács, Joseph MacManus
We study a generalization of the well-known disjoint paths problem which we call the metric Menger problem, denoted MM(r,k), where one is given two subsets of a graph and must deci…