Result 1 to 20 of 41 total
Non-three-colourable common graphs exist. (English)
Comb. Probab. Comput. 21, No. 5, 734-742 (2012).
1
Jacobians of nearly complete and threshold graphs. (English)
Eur. J. Comb. 32, No. 8, 1368-1376 (2011).
2
Turán graphs and the number of colorings. (English)
SIAM J. Discrete Math. 25, No. 1, 260-266 (2011).
3
Exponentially many perfect matchings in cubic graphs. (English)
Adv. Math. 227, No. 4, 1646-1664 (2011).
4
Circular consecutive choosability of $k$-choosable graphs. (English)
J. Graph Theory 67, No. 3, 178-197 (2011).
5
Undecidability of linear inequalities in graph homomorphism densities. (English)
J. Am. Math. Soc. 24, No. 2, 547-565 (2011).
6
Jacobians of nearly complete and threshold graphs (English)
Eur. J. Comb. 32, No. 8, 1368-1376 (2011).
7
Circular consecutive choosability of $k$-choosable graphs (English)
Journal of Graph Theory 67, No. 3, 178-197 (2011).
8
Markov bases of binary graph models of $K_{4}$-minor free graphs. (English)
J. Comb. Theory, Ser. A 117, No. 6, 759-765 (2010).
9
Small graph classes and bounded expansion. (English)
J. Comb. Theory, Ser. B 100, No. 2, 171-175 (2010).
10
Markov bases of binary graph models of $K_{4}$-minor free graphs (English)
J. Comb. Theory, Ser. A 117, No. 6, 759-765 (2010).
11
Small graph classes and bounded expansion (English)
J. Comb. Theory, Ser. B 100, No. 2, 171-175 (2010).
12
Holographic algorithms without matchgates. (English)
Comput. Res. Repos. 2009, Article No. 0904.0471 (2009).
13
Harmonic morphisms and hyperelliptic graphs. (English)
Int. Math. Res. Not. 2009, No. 15, 2914-2955 (2009).
14
Circular degree choosability. (English)
Electron. J. Comb. 15, No. 1, Research Paper R100, 8 p. (2008).
15
Circular choosability via combinatorial nullstellensatz. (English)
J. Graph Theory 59, No. 3, 190-204 (2008).
16
Pfaffian labelings and signs of edge colorings. (English)
Combinatorica 28, No. 1, 99-111 (2008).
17
Pfaffian graphs, $T$-joins and crossing numbers. (English)
Combinatorica 28, No. 1, 89-98 (2008).
18
Graphs with full rank 3-color matrix and few 3-colorings. (English)
J. Comb. Theory, Ser. B 98, No. 5, 1115-1116 (2008).
19
Minimally non-Pfaffian graphs. (English)
J. Comb. Theory, Ser. B 98, No. 5, 1038-1055 (2008).
20
Result 1 to 20 of 41 total
Start
Contact
Print
General Help
