Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 | next | last

Result 1 to 20 of 81 total

When trees grow low: shrubs and fast MSO$_{1}$. (English)
Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 419-430 (2012).
WorldCat.org
1
Sparsity. Graphs, structures, and algorithms. (English)
Algorithms and Combinatorics 28. Berlin: Springer (ISBN 978-3-642-27874-7/hbk; 978-3-642-27875-4/ebook). xxiii, 457~p. EUR~59.95/net; SFR~80.00; \$~79.95; \sterling~53.99 (2012).
WorldCat.org
2
Decomposing a graph into forests. (English)
J. Comb. Theory, Ser. B 102, No. 1, 38-52 (2012).
WorldCat.org
3
Characterisations and examples of graph classes with bounded expansion. (English)
Eur. J. Comb. 33, No. 3, 350-373 (2012).
WorldCat.org
4
Trémaux trees and planarity. (English)
Eur. J. Comb. 33, No. 3, 279-293 (2012).
WorldCat.org
5
Decomposing a graph into forests (English)
J. Comb. Theory, Ser. B 102, No. 1, 38-52 (2012).
WorldCat.org
7
Special issue: Homomorphisms and limits. (English)
Eur. J. Comb. 32, No. 7, 951-1175 (2011).
WorldCat.org
8
Thue choosability of trees. (English)
Discrete Appl. Math. 159, No. 17, 2045-2049 (2011).
WorldCat.org
9
How many $F$’s are there in $G$? (English)
Eur. J. Comb. 32, No. 7, 1126-1141 (2011).
WorldCat.org
10
Sparse combinatorial structures: classification and applications. (English)
Bhatia, Rajendra (ed.) et al., Proceedings of the international congress of mathematicians (ICM 2010), Hyderabad, India, August 19‒27, 2010. Vol. IV: Invited lectures. Hackensack, NJ: World Scientific; New Delhi: Hindustan Book Agency (ISBN 978-981-4324-34-2/hbk; 978-81-85931-08-3/hbk; 978-981-4324-31-1/set; 978-981-4324-35-9/ebook). 2502-2529 (2011).
WorldCat.org
11
On nowhere dense graphs. (English)
Eur. J. Comb. 32, No. 4, 600-617 (2011).
WorldCat.org
12
How many f’s are there in G? (English)
Eur. J. Comb. 32, No. 7, 1126-1141 (2011).
WorldCat.org
13
On nowhere dense graphs (English)
Eur. J. Comb. 32, No. 4, 600-617 (2011).
WorldCat.org
15
Extremal problems for sparse graphs. (English)
Bárány, Imre (ed.) et al., An irregular mind. Szmerédi is 70. Dedicated to Endre Szemerédi on the occasion of his seventieth birthday. Berlin: Springer (ISBN 978-3-642-14443-1/pbk). Bolyai Society Mathematical Studies 21, 447-490 (2010).
WorldCat.org
16
First order properties on nowhere dense structures. (English)
J. Symb. Log. 75, No. 3, 868-887 (2010).
WorldCat.org
17
From sparse graphs to nowhere dense structures: decompositions, independence, dualities and limits. (English)
Ran, André (ed.) et al., European congress of mathematics. Proceedings of the 5th ECM congress, Amsterdam, Netherlands, July 14‒18, 2008. Zürich: European Mathematical Society (EMS) (ISBN 978-3-03719-077-7/hbk). 135-165 (2010).
WorldCat.org
18
First order properties on nowhere dense structures (English)
J. Symb. Log. 75, No. 3, 868-887 (2010).
WorldCat.org
19
Fraternal augmentations, arrangeability and linear Ramsey numbers. (English)
Eur. J. Comb. 30, No. 7, 1696-1703 (2009).
WorldCat.org
20
first | previous | 1 21 41 61 81 | next | last

Result 1 to 20 of 81 total

Valid XHTML 1.0 Transitional Valid CSS!