|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 16 publication records. Showing 16 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Klas Markström, Andrzej Rucinski |
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees.  |
Eur. J. Comb.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Demetres Christofides, Klas Markström |
The Guessing Number of Undirected Graphs. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Klas Markström, Andrew Thomason, Peter Wagner 0002 |
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. |
Graphs and Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klas Markström |
Two questions of Erdős on hypergraphs above the Tur{á}n threshold} |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Klas Markström, John C. Wierman |
Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klas Markström |
Extremal hypergraphs and bounds for the Turán density of the 4-uniform K5. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Andrén, Klas Markström |
The bivariate Ising polynomial of a graph. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Andrén, Lars Hellström, Klas Markström |
Fast multiplication of matrices over a finitely generated semiring. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Friedland, E. Krop, Klas Markström |
On the Number of Matchings in Regular Graphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Demetres Christofides, Klas Markström |
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Roland Häggkvist, Klas Markström |
Cycle double covers and spanning minors I. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Klas Markström |
Locality and Hard SAT-Instances. |
JSAT |
2006 |
DBLP BibTeX RDF |
|
| 1 | Imre Leader, Klas Markström |
Uncountable families of vertex-transitive graphs of finite degree. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Roland Häggkvist, Klas Markström |
Cycle double covers and spanning minors II. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Klas Markström |
Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
Displaying result #1 - #16 of 16 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")