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 Number of Quasi-Trees in Fans and Wheels

The Electronic journal of combinatorics, 2023-03, Vol.30 (1)

Merino, Criel

2023

Volltextzugriff (PDF)

More connections between the matching polynomial and the chromatic polynomial

AKCE international journal of graphs and combinatorics, 2019-12, Vol.16 (3), p.319-323

2019

Volltextzugriff (PDF)

The chip-firing game

Discrete mathematics, 2005-10, Vol.302 (1), p.188-210

Merino, Criel

2005

Volltextzugriff (PDF)

Some heterochromatic theorems for matroids

Discrete mathematics, 2018-10, Vol.341 (10), p.2694-2699

2018

Volltextzugriff (PDF)

On the evaluation of the Tutte polynomial at the points (1,-1) and (2,-1)

Discrete Mathematics and Theoretical Computer Science, 2011-01, Vol.DMTCS Proceedings vol. AO,... (Proceedings), p.411-422

2011

Volltextzugriff (PDF)

The Tutte Polynomial of Some Matroids

International Journal of Combinatorics, 2012-01, Vol.2012 (2012), p.1-40

2012

Volltextzugriff (PDF)

The Chip Firing Game and Matroid Complexes

Discrete Mathematics and Theoretical Computer Science, 2001-01, Vol.DMTCS Proceedings vol. AA,... (Proceedings), p.245-256

Merino, Criel

2001

Volltextzugriff (PDF)

On zeros of the characteristic polynomial of matroids of bounded tree-width

European journal of combinatorics, 2017-02, Vol.60, p.10-20

2017

Volltextzugriff (PDF)

The Structure of Delta-Matroids with Width One Twists

The Electronic journal of combinatorics, 2018-01, Vol.25 (1)

2018

Volltextzugriff (PDF)

Critical groups of graphs with dihedral actions

European journal of combinatorics, 2014-07, Vol.39, p.95-112

2014

Volltextzugriff (PDF)

On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets

Graphs and combinatorics, 2005-09, Vol.21 (3), p.333-341

2005

Volltextzugriff (PDF)

On the structure of the h-vector of a paving matroid

European journal of combinatorics, 2012-11, Vol.33 (8), p.1787-1799

2012

Volltextzugriff (PDF)

The chip-firing game and the sandpile model

Handbook of the Tutte Polynomial and Related Topics, 2022, p.345-351

1, 2022

Volltextzugriff (PDF)

The chip-firing game: Structural combinatorics: combinatorial and computational aspects of optimization, topology and algebra

Discrete mathematics, 2005, Vol.302 (1-3), p.188-210

MERINO, Criel

2005

Volltextzugriff (PDF)

Computational techniques

Handbook of the Tutte Polynomial and Related Topics, 2022, p.141-160

1, 2022

Volltextzugriff (PDF)

The Equivalence of Two Graph Polynomials and a Symmetric Function

Combinatorics, probability & computing, 2009-07, Vol.18 (4), p.601-615

2009

Volltextzugriff (PDF)

Comparing the Number of Acyclic and Totally Cyclic Orientations with That of Spanning Trees of a Graph

International journal of mathematical combinatorics, 2009-07, Vol.2, p.79-79

2009

Volltextzugriff (PDF)

Nim-O-Do: Un juego para todos

Miscelánea Matemática de la Sociedad Matemática Mexicana, 2021-01, Vol.70, p.17-29

2021

Volltextzugriff (PDF)

A note on some inequalities for the Tutte polynomial of a matroid

Electronic notes in discrete mathematics, 2009-08, Vol.34, p.603-607

2009

Volltextzugriff (PDF)

On the structure of the -vector of a paving matroid

European journal of combinatorics, 2012-11, Vol.33 (8), p.1787-1799

2012

Volltextzugriff (PDF)

On the Broken-Circuit Complex of Graphs

Communications in algebra, 2010-04, Vol.38 (5), p.1847-1854

2010

Volltextzugriff (PDF)

Some inequalities for the Tutte polynomial

European journal of combinatorics, 2011-04, Vol.32 (3), p.422-433

2011

Volltextzugriff (PDF)

Simple Euclidean Arrangements with No (≥ 5)-Gons

Discrete & computational geometry, 2007-10, Vol.38 (3), p.595-603

2007

Volltextzugriff (PDF)

Graph Polynomials and Their Applications I: The Tutte Polynomial

Structural Analysis of Complex Networks, 2010, p.219-255

2010

Volltextzugriff (PDF)

Chip firing and the tutte polynomial

Annals of combinatorics, 1997-12, Vol.1 (1), p.253-259

López, Criel Merino

1997

Volltextzugriff (PDF)

1 – 25 von 27

Menü

Weitere Dienste

Einstellungen

The Number of Quasi-Trees in Fans and Wheels

More connections between the matching polynomial and the chromatic polynomial

The chip-firing game

Some heterochromatic theorems for matroids

On the evaluation of the Tutte polynomial at the points (1,-1) and (2,-1)

The Tutte Polynomial of Some Matroids

The Chip Firing Game and Matroid Complexes

On zeros of the characteristic polynomial of matroids of bounded tree-width

The Structure of Delta-Matroids with Width One Twists

Critical groups of graphs with dihedral actions

On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets

On the structure of the h-vector of a paving matroid

The chip-firing game and the sandpile model

The chip-firing game: Structural combinatorics: combinatorial and computational aspects of optimization, topology and algebra

Computational techniques

The Equivalence of Two Graph Polynomials and a Symmetric Function

Comparing the Number of Acyclic and Totally Cyclic Orientations with That of Spanning Trees of a Graph

Nim-O-Do: Un juego para todos

A note on some inequalities for the Tutte polynomial of a matroid

On the structure of the -vector of a paving matroid

On the Broken-Circuit Complex of Graphs

Some inequalities for the Tutte polynomial

Simple Euclidean Arrangements with No (≥ 5)-Gons

Graph Polynomials and Their Applications I: The Tutte Polynomial

Chip firing and the tutte polynomial

Suchergebnisse filtern