František Kardoš

Available identifiers

zbMath Open kardos.frantisekDBLP82/1557WikidataQ130715165 ScholiaQ130715165MaRDI QIDQ326660

List of research outcomes

Publication	Date of Publication	Type
Note on robust coloring of planar graphs	2025-01-20	Paper
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles	2023-10-04	Paper
Three-cuts are a charm: acyclicity in 3-connected cubic graphs	2023-09-13	Paper
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs	2023-06-27	Paper
Strengthening a Theorem of Meyniel	2023-05-31	Paper
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching	2023-03-23	Paper
Subcubic planar graphs of girth 7 are class I	2022-06-14	Paper
Hamiltonicity of cubic planar graphs with bounded face sizes	2022-05-12	Paper
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching	2022-04-21	Paper
On the 4-color theorem for signed graphs	2021-02-08	Paper
Fractional vertex-arboricity of planar graphs	2020-09-25	Paper
A computer-assisted proof of the Barnette-Goodey conjecture: not only fullerene graphs are Hamiltonian	2020-01-10	Paper
Incidence coloring -- cold cases	2020-01-08	Paper
Sandwiching saturation number of fullerene graphs	2017-07-19	Paper
https://portal.mardi4nfdi.de/entity/Q5279124	2017-07-19	Paper
Mathematical aspects of fullerenes	2017-02-03	Paper
On improper interval edge colourings.	2017-01-13	Paper
First order convergence of matroids	2016-10-12	Paper
Cubic bridgeless graphs have more than a linear number of perfect matchings	2013-10-10	Paper
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs	2012-12-14	Paper
Facial parity edge colouring of plane pseudographs	2012-08-10	Paper
Acyclic edge coloring of planar graphs with \(\varDelta\) colors	2012-05-30	Paper
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs	2012-05-04	Paper
Facial parity edge colouring	2012-03-22	Paper
Fractional colorings of cubic graphs with large girth	2012-03-15	Paper
Looseness of plane graphs	2012-01-24	Paper
On computing the minimum 3-path vertex cover and dissociation number of graphs	2011-12-07	Paper
On the strong parity chromatic number	2011-09-20	Paper
Minimum \(k\)-path vertex cover	2011-08-10	Paper
Exponentially many perfect matchings in cubic graphs	2011-07-25	Paper
The last fraction of a fractional conjecture	2011-04-15	Paper
Fulleroids with dihedral symmetry	2010-03-29	Paper
Cyclic 7-edge-cuts in fullerene graphs	2010-03-02	Paper
Maximum vertex and face degree of oblique graphs	2009-12-15	Paper
Long cycles in fullerene graphs	2009-11-16	Paper
Fullerene graphs have exponentially many perfect matchings	2009-09-02	Paper
Tetrahedral fulleroids	2009-06-23	Paper
Cyclic edge-cuts in fullerene graphs	2008-08-15	Paper
On octahedral fulleroids	2007-09-21	Paper
Fulleroids with Dihedral Symmetry	2007-05-29	Paper
Note on robust coloring of planar graphs	N/A	Paper

Research outcomes over time

This page was built for person: František Kardoš