prof. RNDr. Daniel Kráľ, Ph.D., DSc.
Professor, Department of Computer Science
office: C517
Botanická 554/68a
602 00 Brno
phone: | +420 549 49 6337 |
---|---|
e‑mail: |
social and academic networks: |
---|
Total number of publications: 177
2010
-
Toughness threshold for the existence of 2-walks in K-4-minor-free graphs
Discrete Mathematics, year: 2010, volume: 310, edition: 3, DOI
2009
-
6-CRITICAL GRAPHS ON THE KLEIN BOTTLE
SIAM Journal on Discrete Mathematics, year: 2009, volume: 23, edition: 1, DOI
-
A combinatorial proof of the Removal Lemma for Groups
Journal of Combinatorial Theory, Series A, year: 2009, volume: 116, edition: 4, DOI
-
A NEW LOWER BOUND ON THE NUMBER OF PERFECT MATCHINGS IN CUBIC GRAPHS
SIAM Journal on Discrete Mathematics, year: 2009, volume: 23, edition: 3, DOI
-
A note on edge-colourings avoiding rainbow K-4 and monochromatic K-m
Electronic Journal of Combinatorics, year: 2009, volume: 16, edition: 1
-
Coloring triangle-free graphs on surfaces
, year: 2009
-
Distance constrained labelings of K-4-minor free graphs
Discrete Mathematics, year: 2009, volume: 309, edition: 18, DOI
-
Distance constrained labelings of planar graphs with no short cycles
Discrete Applied Mathematics, year: 2009, volume: 157, edition: 12, DOI
-
Fullerene graphs have exponentially many perfect matchings
JOURNAL OF MATHEMATICAL CHEMISTRY, year: 2009, volume: 46, edition: 2, DOI
-
Graph labellings with variable weights, a survey
Discrete Applied Mathematics, year: 2009, volume: 157, edition: 12, DOI