×

Found 13 Documents (Results 1–13)

A unified approach to structural limits and limits of graphs with bounded tree-depth. (English) Zbl 1491.03004

Memoirs of the American Mathematical Society 1272. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-4065-7/pbk; 978-1-4704-5652-8/ebook). v, 108 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Counting homomorphisms to sparse graphs. (English) Zbl 1273.05146

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 393-397 (2009).
MSC:  05C60 05C30
PDFBibTeX XMLCite
Full Text: DOI

Fraternal augmentations of graphs, coloration and minors. (English) Zbl 1213.05095

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 223-230 (2007).
MSC:  05C15 05C83
PDFBibTeX XMLCite
Full Text: DOI

The grad of a graph and classes with bounded expansion. (English) Zbl 1182.05102

Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 101-106 (2005).
MSC:  05C75 05C15
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field