UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

The maximum degree of random planar graphs

Proceedings of the London Mathematical Society, 2014-10, Vol.109 (4), p.892-920

2014

Volltextzugriff (PDF)

On the Evaluation of the Tutte Polynomial at the Points (1, –1) and (2, –1)

Annals of combinatorics, 2013-06, Vol.17 (2), p.311-332

2013

Volltextzugriff (PDF)

Flipping Edges in Triangulations

Discrete & computational geometry, 1999-10, Vol.22 (3), p.333-346

1999

Volltextzugriff (PDF)

Augmenting the Connectivity of Outerplanar Graphs

Algorithmica, 2010-02, Vol.56 (2), p.160-179

2010

Volltextzugriff (PDF)

The Tutte Polynomial Characterizes Simple Outerplanar Graphs

Combinatorics, probability & computing, 2011-07, Vol.20 (4), p.609-616

2011

Volltextzugriff (PDF)

Graph of triangulations of a convex polygon and tree of triangulations

Computational geometry : theory and applications, 1999-09, Vol.13 (3), p.179-188

1999

Volltextzugriff (PDF)

On the chromatic number of some geometric type Kneser graphs

Computational geometry : theory and applications, 2005-09, Vol.32 (1), p.59-69

2005

Volltextzugriff (PDF)

Locally grid graphs: classification and Tutte uniqueness

Discrete mathematics, 2003-05, Vol.266 (1), p.327-352

2003

Volltextzugriff (PDF)

Graphs determined by polynomial invariants

Theoretical computer science, 2003-10, Vol.307 (2), p.365-384

Noy, Marc

2003

Volltextzugriff (PDF)

Consecutive patterns in permutations

Advances in applied mathematics, 2003-01, Vol.30 (1), p.110-125

2003

Volltextzugriff (PDF)

Bipartite embeddings of trees in the plane

Discrete Applied Mathematics, 1999-07, Vol.93 (2), p.141-148

1999

Volltextzugriff (PDF)

Irreducibility of the Tutte Polynomial of a Connected Matroid

Journal of combinatorial theory. Series B, 2001-11, Vol.83 (2), p.298-304

2001

Volltextzugriff (PDF)

Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice

The Electronic journal of combinatorics, 2003-01, Vol.10 (1)

2003

Volltextzugriff (PDF)

Graphs of Triangulations and Perfect Matchings

Graphs and combinatorics, 2005-09, Vol.21 (3), p.325-331

2005

Volltextzugriff (PDF)

Packing trees into planar graphs

Journal of graph theory, 2002-07, Vol.40 (3), p.172-181

2002

Volltextzugriff (PDF)

Geometric tree graphs of points in convex position

Discrete Applied Mathematics, 1999-04, Vol.93 (1), p.51-66

1999

Volltextzugriff (PDF)

Analytic combinatorics of non-crossing configurations

Discrete mathematics, 1999-06, Vol.204 (1), p.203-229

1999

Volltextzugriff (PDF)

Enumeration of noncrossing trees on a circle

Discrete mathematics, 1998-02, Vol.180 (1), p.301-313

Noy, Marc

1998

Volltextzugriff (PDF)

Lattice path matroids: enumerative aspects and Tutte polynomials

Journal of combinatorial theory. Series A, 2003-10, Vol.104 (1), p.63-94

2003

Volltextzugriff (PDF)

On the chromatic number of tree graphs

Discrete mathematics, 2000-08, Vol.223 (1), p.363-366

2000

Volltextzugriff (PDF)

Properties of Random Triangulations and Trees

Discrete & computational geometry, 1999-07, Vol.22 (1), p.105-117

1999

Volltextzugriff (PDF)

A lower bound on the number of triangulations of planar point sets

Computational geometry : theory and applications, 2004-10, Vol.29 (2), p.135-145

2004

Volltextzugriff (PDF)

Ears of triangulations and Catalan numbers

Discrete mathematics, 1996-02, Vol.149 (1), p.319-324

1996

Volltextzugriff (PDF)

Recursively constructible families of graphs

Advances in applied mathematics, 2004, Vol.32 (1), p.350-363

2004

Volltextzugriff (PDF)

Triangulations, visibility graph and reflex vertices of a simple polygon

Computational geometry : theory and applications, 1996-11, Vol.6 (6), p.355-369

1996

Volltextzugriff (PDF)

1 – 25 von 62

Menü

Weitere Dienste

Einstellungen

The maximum degree of random planar graphs

On the Evaluation of the Tutte Polynomial at the Points (1, –1) and (2, –1)

Flipping Edges in Triangulations

Augmenting the Connectivity of Outerplanar Graphs

The Tutte Polynomial Characterizes Simple Outerplanar Graphs

Graph of triangulations of a convex polygon and tree of triangulations

On the chromatic number of some geometric type Kneser graphs

Locally grid graphs: classification and Tutte uniqueness

Graphs determined by polynomial invariants

Consecutive patterns in permutations

Bipartite embeddings of trees in the plane

Irreducibility of the Tutte Polynomial of a Connected Matroid

Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice

Graphs of Triangulations and Perfect Matchings

Packing trees into planar graphs

Geometric tree graphs of points in convex position

Analytic combinatorics of non-crossing configurations

Enumeration of noncrossing trees on a circle

Lattice path matroids: enumerative aspects and Tutte polynomials

On the chromatic number of tree graphs

Properties of Random Triangulations and Trees

A lower bound on the number of triangulations of planar point sets

Ears of triangulations and Catalan numbers

Recursively constructible families of graphs

Triangulations, visibility graph and reflex vertices of a simple polygon

Aktive Filter

Suchergebnisse filtern