Frantisek Kardos

According to our database, Frantisek Kardos authored at least 27 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs.

Frantisek Kardos, Jonathan Narboni, Reza Naserasr, Zhouningxin Wang

SIAM J. Discret. Math., June, 2023

Strengthening a Theorem of Meyniel.

Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron

SIAM J. Discret. Math., June, 2023

Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching.

Frantisek Kardos, Edita Mácajová, Jean Paul Zerafa

J. Comb. Theory, Ser. B, May, 2023

2022

Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes.

Frantisek Kardos

SIAM Rev., 2022

Subcubic planar graphs of girth 7 are class I.

Sebastien Bonduelle, Frantisek Kardos

Discret. Math., 2022

2021

At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles.

Frantisek Kardos, Martina Mockovciaková

J. Graph Theory, 2021

On the 4-color theorem for signed graphs.

Frantisek Kardos, Jonathan Narboni

Eur. J. Comb., 2021

2020

A Computer-Assisted Proof of the Barnette-Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian.

Frantisek Kardos

SIAM J. Discret. Math., 2020

Incidence coloring-cold cases.

Frantisek Kardos, Mária Maceková, Martina Mockovciaková, Éric Sopena, Roman Soták

Discuss. Math. Graph Theory, 2020

2017

First order convergence of matroids.

Frantisek Kardos, Daniel Král', Anita Liebenau, Lukás Mach

Eur. J. Comb., 2017

2016

On concept reduction based on some graph properties.

Frantisek Kardos, Jozef Pócs, Jana Pócsova

Knowl. Based Syst., 2016

Mathematical aspects of fullerenes.

Vesna Andova, Frantisek Kardos, Riste Skrekovski

Ars Math. Contemp., 2016

2012

Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.

Frantisek Kardos, Daniel Král', Jan Volec

Random Struct. Algorithms, 2012

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs.

Louis Esperet, Frantisek Kardos, Daniel Král'

Eur. J. Comb., 2012

Facial parity edge colouring of plane pseudographs.

Július Czap, Stanislav Jendrol', Frantisek Kardos, Roman Soták

Discret. Math., 2012

Acyclic edge coloring of planar graphs with Δ colors.

Dávid Hudák, Frantisek Kardos, Borut Luzar, Roman Soták, Riste Skrekovski

Discret. Appl. Math., 2012

2011

On computing the minimum 3-path vertex cover and dissociation number of graphs.

Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer

Theor. Comput. Sci., 2011

Fractional colorings of cubic graphs with large girth.

Frantisek Kardos, Daniel Král', Jan Volec

SIAM J. Discret. Math., 2011

Looseness of Plane Graphs.

Július Czap, Stanislav Jendrol', Frantisek Kardos, Jozef Miskuf

Graphs Comb., 2011

On strong parity chromatic number.

Július Czap, Stanislav Jendrol', Frantisek Kardos

Discuss. Math. Graph Theory, 2011

Minimum k-path vertex cover.

Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin

Discret. Appl. Math., 2011

Facial parity edge colouring.

Július Czap, Stanislav Jendrol', Frantisek Kardos

Ars Math. Contemp., 2011

2010

The Last Fraction of a Fractional Conjecture.

Frantisek Kardos, Daniel Král', Jean-Sébastien Sereni

SIAM J. Discret. Math., 2010

2009

Cubic bridgeless graphs have more than a linear number of perfect matchings.

Louis Esperet, Frantisek Kardos, Daniel Král

Electron. Notes Discret. Math., 2009

Maximum vertex and face degree of oblique graphs.

Frantisek Kardos, Jozef Miskuf

Discret. Math., 2009

2007

Fulleroids with Dihedral Symmetry.

Frantisek Kardos

Electron. Notes Discret. Math., 2007

On octahedral fulleroids.

Stanislav Jendrol', Frantisek Kardos

Discret. Appl. Math., 2007