František Kardoš

Most-cited papers

Minimum k-path vertex cover
B. Brešar, František Kardoš, Ján Katrenic, Gabriel Semanišin
2010Discrete Applied Mathematics176 citations Open access
Semantic Scholar
On computing the minimum 3-path vertex cover and dissociation number of graphs
František Kardoš, Ján Katrenic, I. Schiermeyer
2011Theoretical Computer Science88 citations Open access
Semantic Scholar
Exponentially many perfect matchings in cubic graphs
L. Esperet, František Kardoš, Andrew D. King, D. Král' +1 more
201066 citations Open access
Semantic Scholar
Mathematical aspects of fullerenes
Vesna Andova, František Kardoš, R. Škrekovski
2016Ars Math. Contemp.59 citations Open access
Semantic Scholar
Fullerene graphs have exponentially many perfect matchings
František Kardoš, D. Král', Jozef Miskuf, Jean-Sébastien Sereni
200850 citations Open access
Semantic Scholar
Cyclic edge-cuts in fullerene graphs
František Kardoš, R. Škrekovski
200844 citations Open access
Semantic Scholar
Cyclic 7-edge-cuts in fullerene graphs
František Kardoš, Matjaž Krnc, Borut Lužar, R. Škrekovski
200837 citations Open access
Semantic Scholar
On the 4-color theorem for signed graphs
František Kardoš, Jonathan Narboni
2019European journal of combinatorics (Print)30 citations Open access
Semantic Scholar
First order convergence of matroids
František Kardoš, D. Král', Anita Liebenau, Lukás Mach
2015European journal of combinatorics (Print)23 citations Open access
Semantic Scholar
Facial parity edge colouring of plane pseudographs
J. Czap, S. Jendrol', František Kardoš, R. Soták
2012Discrete Mathematics20 citations Open access
Semantic Scholar
A Computer-Assisted Proof of the Barnette-Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian
František Kardoš
2020SIAM Journal on Discrete Mathematics19 citations Open access
Semantic Scholar
On concept reduction based on some graph properties
František Kardoš, J. Pócs, J. Pócsová
2016Knowledge-Based Systems18 citations Open access
Semantic Scholar
Fractional colorings of cubic graphs with large girth
František Kardoš, D. Král', Jan Volec
2010SIAM Journal on Discrete Mathematics17 citations Open access
Semantic Scholar
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
František Kardoš, Edita Máčajová, J. P. Zerafa
2022J. Comb. Theory B15 citations Open access
Semantic Scholar
Facial parity edge colouring
J. Czap, S. Jendrol', František Kardoš
2011Ars Math. Contemp.14 citations Open access
Semantic Scholar
Maximum edge‐cuts in cubic graphs with large girth and in random cubic graphs
František Kardoš, D. Král', Jan Volec
2011Random Struct. Algorithms13 citations Open access
Semantic Scholar
On Diameter of Nanotubical Fullerene Graphs
Vesna Andova, Domen Blenkus, T. Došlić, František Kardoš +1 more
201510 citations
Semantic Scholar
Long cycles in fullerene graphs
R. Erman, František Kardoš, Jozef Miskuf
200910 citations Open access
Semantic Scholar
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
L. Esperet, František Kardoš, D. Král'
2010European journal of combinatorics (Print)8 citations Open access
Semantic Scholar
The Structure of Binary Matroids with no Induced Claw or Fano Plane Restriction
P. Nelson, Luke Postle, Tom Kelly, František Kardoš +1 more
2018Advances in Combinatorics7 citations Open access
Semantic Scholar
Fullerene Graphs and Some Relevant Graph Invariants
Vesna Andova, František Kardoš, R. Škrekovski
20187 citations
Semantic Scholar
Acyclic edge coloring of planar graphs with ∆ colors
Dávid Hudák, František Kardoš, Borut Lužar, R. Soták +1 more
20107 citations
Semantic Scholar
The Last Fraction of a Fractional Conjecture
František Kardoš, D. Král', Jean-Sébastien Sereni
2009SIAM Journal on Discrete Mathematics7 citations Open access
Semantic Scholar
On octahedral fulleroids
S. Jendrol', František Kardoš
2007Discrete Applied Mathematics7 citations Open access
Semantic Scholar
On improper interval edge colourings
Péter Hudák, František Kardoš, T. Madaras, Michaela Vrbjarová
20165 citations Open access
Semantic Scholar
Tetrahedral Fulleroids
František Kardoš
20075 citations
Semantic Scholar
Strengthening a theorem of Meyniel
Quentin Deschamps, Carl Feghali, František Kardoš, Clément Legrand-Duchesne +1 more
2022SIAM Journal on Discrete Mathematics4 citations Open access
Semantic Scholar
On strong parity chromatic number
J. Czap, S. Jendrol', František Kardoš
2011Discussiones Mathematicae Graph Theory4 citations Open access
Semantic Scholar
An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
L. de Meyer, František Kardoš, Aurélie Lagoutte, G. Perarnau
2025arXiv.org3 citations
Semantic Scholar
Three-Cuts are a Charm: Acyclicity in 3-Connected Cubic Graphs
František Kardoš, Edita Máčajová, J. P. Zerafa
2023Combinatorica3 citations Open access
Semantic Scholar
Subcubic planar graphs of girth 7 are class I
Sebastien Bonduelle, František Kardoš
2021Discrete Mathematics3 citations Open access
Semantic Scholar
Fractional vertex-arboricity of planar graphs
Marthe Bonamy, František Kardoš, Tom Kelly, Luke Postle
20203 citations
Semantic Scholar
Incidence Coloring—Cold Cases
František Kardoš, M. Maceková, Martina Mockovciaková, É. Sopena +1 more
2019Discussiones Mathematicae Graph Theory3 citations Open access
Semantic Scholar
Looseness of Plane Graphs
J. Czap, S. Jendrol', František Kardoš, Jozef Miskuf
2011Graphs Comb.3 citations
Semantic Scholar
Cubic bridgeless graphs have more than a linear number of perfect matchings
L. Esperet, František Kardoš, D. Král'
2009Electron. Notes Discret. Math.3 citations
Semantic Scholar
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs
František Kardoš, Jonathan Narboni, R. Naserasr, Zhouningxin Wang
2023SIAM Journal on Discrete Mathematics2 citations
Semantic Scholar
Circular (4 − (cid:15) )-coloring of some classes of signed graphs
František Kardoš, Jonathan Narboni, R. Naserasr, Zhouningxin Wang
20212 citations
Semantic Scholar
Acyclic edge coloring of planar graphs with Δ colors
Dávid Hudák, František Kardoš, Borut Lužar, R. Soták +1 more
2012Discrete Applied Mathematics1 citations Open access
Semantic Scholar
Symmetry of Fulleroids
S. Jendrol', František Kardoš
20101 citations
Semantic Scholar
A hill-climbing version of Vizing's theorem
L. de Meyer, František Kardoš, Aurélie Lagoutte, G. Perarnau
2027Discrete Mathematics0 citations Open access
Semantic Scholar
Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes
František Kardoš
2022SIAM Review0 citations
Semantic Scholar
Acyclic edge coloring of planar graphs with Delta colors
Dávid Hudák, František Kardoš, Borut Lužar, R. Soták +1 more
20200 citations
Semantic Scholar
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles
František Kardoš, Martina Mockovciaková
2019Journal of Graph Theory0 citations Open access
Semantic Scholar
Incidence coloring of graphs with bounded maximum average degree
František Kardoš, M. Maceková, Martina Mockovciaková, É. Sopena +1 more
20180 citations
Semantic Scholar
On improper interval edge colourings
Péter Hudák, František Kardoš, T. Madaras, Michaela Vrbjarová
2016Czechoslovak Mathematical Journal0 citations Open access
Semantic Scholar
Graph Theory 31 ( 2011 ) 587 – 600 ON THE STRONG PARITY CHROMATIC NUMBER
J. Czap, S. Jendrol', František Kardoš
20110 citations
Semantic Scholar
Discussiones Mathematicae on the Strong Parity Chromatic Number
J. Czap, S. Jendrol', František Kardoš
20110 citations
Semantic Scholar
Cake slicing , path counting and wait-free synchronizing
B. Ries, František Kardoš
20090 citations
Semantic Scholar
Maximum vertex and face degree of oblique graphs
František Kardoš, Jozef Miskuf
2009Discrete Mathematics0 citations Open access
Semantic Scholar
Fulleroids with Dihedral Symmetry
František Kardoš
2007Electron. Notes Discret. Math.0 citations Open access
Semantic Scholar