default search action
Frantisek Kardos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j28]Frantisek Kardos, Edita Mácajová, Jean Paul Zerafa:
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching. J. Comb. Theory B 160: 1-14 (2023) - [j27]Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron:
Strengthening a Theorem of Meyniel. SIAM J. Discret. Math. 37(2): 604-611 (2023) - [j26]Frantisek Kardos, Jonathan Narboni, Reza Naserasr, Zhouningxin Wang:
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs. SIAM J. Discret. Math. 37(2): 1198-1211 (2023) - 2022
- [j25]Sebastien Bonduelle, Frantisek Kardos:
Subcubic planar graphs of girth 7 are class I. Discret. Math. 345(10): 113002 (2022) - [j24]Frantisek Kardos:
Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes. SIAM Rev. 64(2): 425-465 (2022) - [i4]Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron:
Strengthening a theorem of Meyniel. CoRR abs/2201.07595 (2022) - 2021
- [j23]Frantisek Kardos, Jonathan Narboni:
On the 4-color theorem for signed graphs. Eur. J. Comb. 91: 103215 (2021) - [j22]Frantisek Kardos, Martina Mockovciaková:
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles. J. Graph Theory 97(3): 382-392 (2021) - [i3]Sebastien Bonduelle, Frantisek Kardos:
Subcubic planar graphs of girth 7 are class I. CoRR abs/2108.06115 (2021) - 2020
- [j21]Frantisek Kardos, Mária Maceková, Martina Mockovciaková, Éric Sopena, Roman Soták:
Incidence coloring-cold cases. Discuss. Math. Graph Theory 40(1): 345-354 (2020) - [j20]Frantisek Kardos:
A Computer-Assisted Proof of the Barnette-Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian. SIAM J. Discret. Math. 34(1): 62-100 (2020)
2010 – 2019
- 2017
- [j19]Frantisek Kardos, Daniel Král', Anita Liebenau, Lukás Mach:
First order convergence of matroids. Eur. J. Comb. 59: 150-168 (2017) - 2016
- [j18]Vesna Andova, Frantisek Kardos, Riste Skrekovski:
Mathematical aspects of fullerenes. Ars Math. Contemp. 11(2): 353-379 (2016) - [j17]Frantisek Kardos, Jozef Pócs, Jana Pócsova:
On concept reduction based on some graph properties. Knowl. Based Syst. 93: 67-74 (2016) - 2015
- [i2]Frantisek Kardos, Daniel Král, Anita Liebenau, Lukás Mach:
First order convergence of matroids. CoRR abs/1501.06518 (2015) - 2012
- [j16]Dávid Hudák, Frantisek Kardos, Borut Luzar, Roman Soták, Riste Skrekovski:
Acyclic edge coloring of planar graphs with Δ colors. Discret. Appl. Math. 160(9): 1356-1368 (2012) - [j15]Július Czap, Stanislav Jendrol', Frantisek Kardos, Roman Soták:
Facial parity edge colouring of plane pseudographs. Discret. Math. 312(17): 2735-2740 (2012) - [j14]Louis Esperet, Frantisek Kardos, Daniel Král':
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. Eur. J. Comb. 33(5): 767-798 (2012) - [j13]Frantisek Kardos, Daniel Král', Jan Volec:
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. Random Struct. Algorithms 41(4): 506-520 (2012) - 2011
- [j12]Július Czap, Stanislav Jendrol', Frantisek Kardos:
Facial parity edge colouring. Ars Math. Contemp. 4(2): 255-269 (2011) - [j11]Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin:
Minimum k-path vertex cover. Discret. Appl. Math. 159(12): 1189-1195 (2011) - [j10]Július Czap, Stanislav Jendrol', Frantisek Kardos:
On strong parity chromatic number. Discuss. Math. Graph Theory 31(3): 587-600 (2011) - [j9]Július Czap, Stanislav Jendrol', Frantisek Kardos, Jozef Miskuf:
Looseness of Plane Graphs. Graphs Comb. 27(1): 73-85 (2011) - [j8]Frantisek Kardos, Daniel Král', Jan Volec:
Fractional colorings of cubic graphs with large girth. SIAM J. Discret. Math. 25(3): 1454-1476 (2011) - [j7]Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer:
On computing the minimum 3-path vertex cover and dissociation number of graphs. Theor. Comput. Sci. 412(50): 7009-7017 (2011) - 2010
- [j6]Frantisek Kardos:
Fulleroids with dihedral symmetry. Discret. Math. 310(3): 652-661 (2010) - [j5]Frantisek Kardos, Daniel Král', Jean-Sébastien Sereni:
The Last Fraction of a Fractional Conjecture. SIAM J. Discret. Math. 24(2): 699-707 (2010) - [i1]Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin:
Minimum k-path vertex cover. CoRR abs/1012.2088 (2010)
2000 – 2009
- 2009
- [j4]Frantisek Kardos, Jozef Miskuf:
Maximum vertex and face degree of oblique graphs. Discret. Math. 309(15): 4942-4948 (2009) - [j3]Louis Esperet, Frantisek Kardos, Daniel Král:
Cubic bridgeless graphs have more than a linear number of perfect matchings. Electron. Notes Discret. Math. 34: 411-415 (2009) - 2007
- [j2]Stanislav Jendrol', Frantisek Kardos:
On octahedral fulleroids. Discret. Appl. Math. 155(16): 2181-2186 (2007) - [j1]Frantisek Kardos:
Fulleroids with Dihedral Symmetry. Electron. Notes Discret. Math. 28: 287-292 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint