1. At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles. Issue 3 (11th January 2021) Authors: Kardoš, František; Mockovčiaková, Martina Journal: Journal of graph theory Issue: Volume 97:Issue 3(2021) Page Start: 382 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. First order convergence of matroids. (January 2017) Authors: Kardoš, František; Král', Daniel; Liebenau, Anita; Mach, Lukáš Journal: European journal of combinatorics Issue: Volume 59(2017) Page Start: 150 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. On the 4-color theorem for signed graphs. (January 2021) Authors: Kardoš, František; Narboni, Jonathan Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗