František Kardoš

From MaRDI portal
(Redirected from Person:326660)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Note on robust coloring of planar graphs
Opuscula Mathematica
2025-01-20Paper
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles
Journal of Graph Theory
2023-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 Graphs
SIAM Journal on Discrete Mathematics
2023-06-27Paper
Strengthening a Theorem of Meyniel
SIAM Journal on Discrete Mathematics
2023-05-31Paper
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
Journal of Combinatorial Theory. Series B
2023-03-23Paper
Subcubic planar graphs of girth 7 are class I
Discrete Mathematics
2022-06-14Paper
Hamiltonicity of cubic planar graphs with bounded face sizes
SIAM Review
2022-05-12Paper
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
(available as arXiv preprint)
2022-04-21Paper
On the 4-color theorem for signed graphs
European Journal of Combinatorics
2021-02-08Paper
Fractional vertex-arboricity of planar graphs2020-09-25Paper
A computer-assisted proof of the Barnette-Goodey conjecture: not only fullerene graphs are Hamiltonian
SIAM Journal on Discrete Mathematics
2020-01-10Paper
Incidence coloring -- cold cases
Discussiones Mathematicae Graph Theory
2020-01-08Paper
Sandwiching saturation number of fullerene graphs
(available as arXiv preprint)
2017-07-19Paper
scientific article; zbMATH DE number 6749528 (Why is no real title available?)2017-07-19Paper
Mathematical aspects of fullerenes
Ars Mathematica Contemporanea
2017-02-03Paper
On improper interval edge colourings.
Czechoslovak Mathematical Journal
2017-01-13Paper
First order convergence of matroids
European Journal of Combinatorics
2016-10-12Paper
Cubic bridgeless graphs have more than a linear number of perfect matchings
Electronic Notes in Discrete Mathematics
2013-10-10Paper
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
Random Structures & Algorithms
2012-12-14Paper
Facial parity edge colouring of plane pseudographs
Discrete Mathematics
2012-08-10Paper
Acyclic edge coloring of planar graphs with \(\varDelta\) colors
Discrete Applied Mathematics
2012-05-30Paper
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
European Journal of Combinatorics
2012-05-04Paper
Facial parity edge colouring
Ars Mathematica Contemporanea
2012-03-22Paper
Fractional colorings of cubic graphs with large girth
SIAM Journal on Discrete Mathematics
2012-03-15Paper
Looseness of plane graphs
Graphs and Combinatorics
2012-01-24Paper
On computing the minimum 3-path vertex cover and dissociation number of graphs
Theoretical Computer Science
2011-12-07Paper
On the strong parity chromatic number
Discussiones Mathematicae Graph Theory
2011-09-20Paper
Minimum \(k\)-path vertex cover
Discrete Applied Mathematics
2011-08-10Paper
Exponentially many perfect matchings in cubic graphs
Advances in Mathematics
2011-07-25Paper
The last fraction of a fractional conjecture
SIAM Journal on Discrete Mathematics
2011-04-15Paper
Fulleroids with dihedral symmetry
Discrete Mathematics
2010-03-29Paper
Cyclic 7-edge-cuts in fullerene graphs
Journal of Mathematical Chemistry
2010-03-02Paper
Maximum vertex and face degree of oblique graphs
Discrete Mathematics
2009-12-15Paper
Long cycles in fullerene graphs
Journal of Mathematical Chemistry
2009-11-16Paper
Fullerene graphs have exponentially many perfect matchings
Journal of Mathematical Chemistry
2009-09-02Paper
Tetrahedral fulleroids
Journal of Mathematical Chemistry
2009-06-23Paper
Cyclic edge-cuts in fullerene graphs
Journal of Mathematical Chemistry
2008-08-15Paper
On octahedral fulleroids
Discrete Applied Mathematics
2007-09-21Paper
Fulleroids with Dihedral Symmetry
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Note on robust coloring of planar graphs
(available as arXiv preprint)
N/APaper


Research outcomes over time


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