3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2025
Odd and Even Harder Problems on Cycle-Factors
Florian Hörsch, Csaba Király, Mirabel Mendoza-Cadena +3
For a graph (undirected or directed), a cycle-factor is a collection of vertex-disjoint cycles covering the entire vertex set. Cycle-factors subject to parity constraints arise nat…
cs.DS2023
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena +3
We consider the Shortest Odd Path problem, where given an undirected graph , a weight function on its edges, and two vertices and in , the aim is to find an -p…
math.CO2022★ 3 cited
Count and cofactor matroids of highly connected graphs
Dániel Garamvölgyi, Tibor Jordán, Csaba Király
We consider two types of matroids defined on the edge set of a graph : count matroids , in which independence is defined by a sparsity count involving the…