František Kardoš

From MaRDI portal
Person:326660

Available identifiers

zbMath Open kardos.frantisekMaRDI QIDQ326660

List of research outcomes

PublicationDate of PublicationType
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles2023-10-04Paper
Three-cuts are a charm: acyclicity in 3-connected cubic graphs2023-09-13Paper
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs2023-06-27Paper
Strengthening a Theorem of Meyniel2023-05-31Paper
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching2023-03-23Paper
Subcubic planar graphs of girth 7 are class I2022-06-14Paper
Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes2022-05-12Paper
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching2022-04-21Paper
On the 4-color theorem for signed graphs2021-02-08Paper
Fractional vertex-arboricity of planar graphs2020-09-25Paper
A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian2020-01-10Paper
Incidence coloring -- cold cases2020-01-08Paper
Sandwiching saturation number of fullerene graphs2017-07-19Paper
https://portal.mardi4nfdi.de/entity/Q52791242017-07-19Paper
Mathematical aspects of fullerenes2017-02-03Paper
On improper interval edge colourings2017-01-13Paper
First order convergence of matroids2016-10-12Paper
Cubic bridgeless graphs have more than a linear number of perfect matchings2013-10-10Paper
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs2012-12-14Paper
Facial parity edge colouring of plane pseudographs2012-08-10Paper
Acyclic edge coloring of planar graphs with \(\varDelta\) colors2012-05-30Paper
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs2012-05-04Paper
Facial parity edge colouring2012-03-22Paper
Fractional colorings of cubic graphs with large girth2012-03-15Paper
Looseness of plane graphs2012-01-24Paper
On computing the minimum 3-path vertex cover and dissociation number of graphs2011-12-07Paper
On the strong parity chromatic number2011-09-20Paper
Minimum \(k\)-path vertex cover2011-08-10Paper
Exponentially many perfect matchings in cubic graphs2011-07-25Paper
The Last Fraction of a Fractional Conjecture2011-04-15Paper
Fulleroids with dihedral symmetry2010-03-29Paper
Cyclic 7-edge-cuts in fullerene graphs2010-03-02Paper
Maximum vertex and face degree of oblique graphs2009-12-15Paper
Long cycles in fullerene graphs2009-11-16Paper
Fullerene graphs have exponentially many perfect matchings2009-09-02Paper
Tetrahedral fulleroids2009-06-23Paper
Cyclic edge-cuts in fullerene graphs2008-08-15Paper
On octahedral fulleroids2007-09-21Paper
Fulleroids with Dihedral Symmetry2007-05-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


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