Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Klas Markström
2010 – today
- 2013
[j24]J. Robert Johnson, Klas Markström: Turán and Ramsey Properties of Subcube Intersection Graphs. Combinatorics, Probability & Computing 22(1): 55-70 (2013)- [j23]Allan Lo, Klas Markström: A Multipartite Version of the Hajnal-Szemerédi Theorem for Graphs and Hypergraphs. Combinatorics, Probability & Computing 22(1): 97-111 (2013)
- [j22]Allan Lo, Klas Markström: Minimum codegree threshold for -factors. J. Comb. Theory, Ser. A 120(3): 708-721 (2013)
- 2012
- [j21]Jonas Hägglund, Klas Markström: On stable cycles and cycle double covers of graphs with large circumference. Discrete Mathematics 312(17): 2540-2544 (2012)
- [j20]Klas Markström: Even cycle decompositions of 4-regular graphs and line graphs. Discrete Mathematics 312(17): 2676-2681 (2012)
- [j19]Demetres Christofides, Klas Markström: Random Latin square graphs. Random Struct. Algorithms 41(1): 47-65 (2012)
- [i2]Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström: Generation and Properties of Snarks. CoRR abs/1206.6690 (2012)
- 2011
- [j18]Demetres Christofides, Klas Markström: The Guessing Number of Undirected Graphs. Electr. J. Comb. 18(1) (2011)
- [j17]Klas Markström, Andrzej Rucinski: Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. Eur. J. Comb. 32(5): 677-687 (2011)
- [j16]Klas Markström, Andrew Thomason, Peter Wagner: Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. Graphs and Combinatorics 27(2): 243-249 (2011)
- [i1]Klas Markström: Two questions of Erdős on hypergraphs above the Tur{á}n threshold}. CoRR abs/1111.5743 (2011)
- 2010
- [j15]Anders Johansson, Robert Johansson, Klas Markström: Factors of r-partite graphs and bounds for the Strong Chromatic Number. Ars Comb. 95 (2010)
- [j14]Klas Markström, Lars-Daniel Öhman: Unavoidable arrays. Contributions to Discrete Mathematics 5(1) (2010)
- [j13]Klas Markström, John C. Wierman: Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models. Electr. J. Comb. 17(1) (2010)
- [j12]Shmuel Friedland, Per Håkan Lundow, Klas Markström: The 1-vertex transfer matrix and accurate estimation of channel capacity. IEEE Transactions on Information Theory 56(8): 3692-3699 (2010)
2000 – 2009
- 2009
- [j11]Daniel Andrén, Klas Markström: The bivariate Ising polynomial of a graph. Discrete Applied Mathematics 157(11): 2515-2524 (2009)
- [j10]Klas Markström: Extremal hypergraphs and bounds for the Turán density of the 4-uniform K5. Discrete Mathematics 309(16): 5231-5234 (2009)
- 2008
- [j9]Shmuel Friedland, E. Krop, Klas Markström: On the Number of Matchings in Regular Graphs. Electr. J. Comb. 15(1) (2008)
- [j8]Daniel Andrén, Lars Hellström, Klas Markström: Fast multiplication of matrices over a finitely generated semiring. Inf. Process. Lett. 107(6): 230-234 (2008)
- [j7]Demetres Christofides, Klas Markström: Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. Random Struct. Algorithms 32(1): 88-100 (2008)
- 2006
- [j6]Imre Leader, Klas Markström: Uncountable families of vertex-transitive graphs of finite degree. Discrete Mathematics 306(7): 678-679 (2006)
- [j5]Roland Häggkvist, Klas Markström: Cycle double covers and spanning minors II. Discrete Mathematics 306(8-9): 762-778 (2006)
- [j4]Per Håkan Lundow, Klas Markström: Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials. Experimental Mathematics 15(3): 343-353 (2006)
- [j3]Roland Häggkvist, Klas Markström: Cycle double covers and spanning minors I. J. Comb. Theory, Ser. B 96(2): 183-206 (2006)
- [j2]
- 2004
- [j1]Klas Markström: Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs. Ars Comb. 70 (2004)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-16 22:09 CEST by the dblp team