dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Frantisek Kardos Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDávid Hudák, Frantisek Kardos, Borut Luzar, Roman Sotak, Riste Skrekovski: Acyclic edge coloring of planar graphs with Δ colors. Discrete Applied Mathematics 160(9): 1356-1368 (2012)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLouis 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)
2011
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin: Minimum k-path vertex cover. Discrete Applied Mathematics 159(12): 1189-1195 (2011)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJúlius Czap, Stanislav Jendrol, Frantisek Kardos: On strong parity chromatic number. Discussiones Mathematicae Graph Theory 31(3): 587-600 (2011)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJúlius Czap, Stanislav Jendrol, Frantisek Kardos, Jozef Miskuf: Looseness of Plane Graphs. Graphs and Combinatorics 27(1): 73-85 (2011)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrantisek Kardos, Daniel Král', Jan Volec: Fractional colorings of cubic graphs with large girth. SIAM J. Discrete Math. 25(3): 1454-1476 (2011)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrantisek 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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin: Minimum k-path vertex cover CoRR abs/1012.2088: (2010)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrantisek Kardos: Fulleroids with dihedral symmetry. Discrete Mathematics 310(3): 652-661 (2010)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrantisek Kardos, Daniel Král', Jean-Sébastien Sereni: The Last Fraction of a Fractional Conjecture. SIAM J. Discrete Math. 24(2): 699-707 (2010)
2009
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrantisek Kardos, Jozef Miskuf: Maximum vertex and face degree of oblique graphs. Discrete Mathematics 309(15): 4942-4948 (2009)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLouis Esperet, Frantisek Kardos, Daniel Král: Cubic bridgeless graphs have more than a linear number of perfect matchings. Electronic Notes in Discrete Mathematics 34: 411-415 (2009)
2007
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStanislav Jendrol, Frantisek Kardos: On octahedral fulleroids. Discrete Applied Mathematics 155(16): 2181-2186 (2007)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrantisek Kardos: Fulleroids with Dihedral Symmetry. Electronic Notes in Discrete Mathematics 28: 287-292 (2007)

Coauthor Index

1Bostjan Bresar [7] [12]
2Július Czap [10] [11]
3Louis Esperet [3] [13]
4Dávid Hudák [14]
5Stanislav Jendrol [2] [10] [11]
6Ján Katrenic [7] [8] [12]
7Daniel Král (Daniel Král') [3] [5] [9] [13]
8Borut Luzar [14]
9Jozef Miskuf [4] [10]
10Ingo Schiermeyer [8]
11Gabriel Semanisin [7] [12]
12Jean-Sébastien Sereni [5]
13Riste Skrekovski [14]
14Roman Sotak [14]
15Jan Volec [9]

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page