Frantisek Kardos
Orcid: 0000-0002-9826-2927
According to our database1,
Frantisek Kardos
authored at least 29 papers
between 2007 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Comb., February, 2025
An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors.
CoRR, January, 2025
2023
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs.
SIAM J. Discret. Math., June, 2023
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching.
J. Comb. Theory B, May, 2023
2022
2021
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles.
J. Graph Theory, 2021
2020
A Computer-Assisted Proof of the Barnette-Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian.
SIAM J. Discret. Math., 2020
2017
2016
2012
Random Struct. Algorithms, 2012
Eur. J. Comb., 2012
2011
Theor. Comput. Sci., 2011
2010
2009
Electron. Notes Discret. Math., 2009
2007