Frantisek Kardos

34 papers Journal 34
YearRankTypeTitle / Venue / Authors
2025 J jnl
An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors.
CoRR
Lucas de Meyer, Frantisek Kardos, Aurélie Lagoutte, Guillem Perarnau
2025 J jnl
Three-Cuts are a Charm: Acyclicity in 3-Connected Cubic Graphs.
Comb.
Frantisek Kardos, Edita Mácajová, Jean Paul Zerafa
2023 J jnl
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs.
SIAM J. Discret. Math.
Frantisek Kardos, Jonathan Narboni, Reza Naserasr, Zhouningxin Wang
2023 J jnl
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching.
J. Comb. Theory B
Frantisek Kardos, Edita Mácajová, Jean Paul Zerafa
2023 J jnl
Strengthening a Theorem of Meyniel.
SIAM J. Discret. Math.
Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
2022 J jnl
Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes.
SIAM Rev.
Frantisek Kardos
2022 J jnl
Strengthening a theorem of Meyniel.
CoRR
Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
2022 J jnl
Subcubic planar graphs of girth 7 are class I.
Discret. Math.
Sebastien Bonduelle, Frantisek Kardos
2021 J jnl
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles.
J. Graph Theory
Frantisek Kardos, Martina Mockovciaková
2021 J jnl
On the 4-color theorem for signed graphs.
Eur. J. Comb.
Frantisek Kardos, Jonathan Narboni
2021 J jnl
Subcubic planar graphs of girth 7 are class I.
CoRR
Sebastien Bonduelle, Frantisek Kardos
2020 J jnl
A Computer-Assisted Proof of the Barnette-Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian.
SIAM J. Discret. Math.
Frantisek Kardos
2020 J jnl
Incidence coloring-cold cases.
Discuss. Math. Graph Theory
Frantisek Kardos, Mária Maceková, Martina Mockovciaková, Éric Sopena, Roman Soták
2017 J jnl
First order convergence of matroids.
Eur. J. Comb.
Frantisek Kardos, Daniel Král', Anita Liebenau, Lukás Mach
2016 J jnl
Mathematical aspects of fullerenes.
Ars Math. Contemp.
Vesna Andova, Frantisek Kardos, Riste Skrekovski
2016 J jnl
On concept reduction based on some graph properties.
Knowl. Based Syst.
Frantisek Kardos, Jozef Pócs, Jana Pócsova
2015 J jnl
First order convergence of matroids.
CoRR
Frantisek Kardos, Daniel Král, Anita Liebenau, Lukás Mach
2012 J jnl
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs.
Eur. J. Comb.
Louis Esperet, Frantisek Kardos, Daniel Král'
2012 J jnl
Acyclic edge coloring of planar graphs with Δ colors.
Discret. Appl. Math.
Dávid Hudák, Frantisek Kardos, Borut Luzar, Roman Soták, Riste Skrekovski
2012 J jnl
Facial parity edge colouring of plane pseudographs.
Discret. Math.
Július Czap, Stanislav Jendrol', Frantisek Kardos, Roman Soták
2012 J jnl
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.
Random Struct. Algorithms
Frantisek Kardos, Daniel Král', Jan Volec
2011 J jnl
Facial parity edge colouring.
Ars Math. Contemp.
Július Czap, Stanislav Jendrol', Frantisek Kardos
2011 J jnl
Fractional colorings of cubic graphs with large girth.
SIAM J. Discret. Math.
Frantisek Kardos, Daniel Král', Jan Volec
2011 J jnl
Looseness of Plane Graphs.
Graphs Comb.
Július Czap, Stanislav Jendrol', Frantisek Kardos, Jozef Miskuf
2011 J jnl
Minimum k-path vertex cover.
Discret. Appl. Math.
Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin
2011 J jnl
On computing the minimum 3-path vertex cover and dissociation number of graphs.
Theor. Comput. Sci.
Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer
2011 J jnl
On strong parity chromatic number.
Discuss. Math. Graph Theory
Július Czap, Stanislav Jendrol', Frantisek Kardos
2010 J jnl
Fulleroids with dihedral symmetry.
Discret. Math.
Frantisek Kardos
2010 J jnl
Minimum k-path vertex cover
CoRR
Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin
2010 J jnl
The Last Fraction of a Fractional Conjecture.
SIAM J. Discret. Math.
Frantisek Kardos, Daniel Král', Jean-Sébastien Sereni
2009 J jnl
Cubic bridgeless graphs have more than a linear number of perfect matchings.
Electron. Notes Discret. Math.
Louis Esperet, Frantisek Kardos, Daniel Král
2009 J jnl
Maximum vertex and face degree of oblique graphs.
Discret. Math.
Frantisek Kardos, Jozef Miskuf
2007 J jnl
Fulleroids with Dihedral Symmetry.
Electron. Notes Discret. Math.
Frantisek Kardos
2007 J jnl
On octahedral fulleroids.
Discret. Appl. Math.
Stanislav Jendrol', Frantisek Kardos