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...

Thinking like a mathematician: an example of discovery-based learning

International journal of mathematical education in science and technology, 2023-02, Vol.54 (2), p.309-324

2023

Volltextzugriff (PDF)

Combinatorial Mathematics: Proceedings of the International Conference on Combinatorial Theory, Canberra, August 16 - 27 1977

1978 edition., 2006

Volltextzugriff (PDF)

Permuting machines and priority queues

Theoretical computer science, 2005-12, Vol.349 (3), p.309-317

2005

Volltextzugriff (PDF)

M-alternating paths in n-extendable bipartite graphs

Discrete mathematics, 2003-07, Vol.269 (1), p.1-11

2003

Volltextzugriff (PDF)

Nonhamiltonian 3-connected cubic planar graphs

SIAM journal on discrete mathematics, 2000, Vol.13 (1), p.25-32

2000

Volltextzugriff (PDF)

Characterizing 2k-critical graphs and n-extendable graphs

Discrete mathematics, 2004-10, Vol.287 (1-3), p.135-139

2004

Volltextzugriff (PDF)

Radiopaque markers in endovascular stents--benefit and potential hazards

RöFo : Fortschritte auf dem Gebiet der Röntgenstrahlen und der bildgebende Verfahren, 2003-04, Vol.175 (4), p.484

2003

Volltextzugriff (PDF)

Restricted permutations and queue jumping

Discrete mathematics, 2004-10, Vol.287 (1), p.129-133

2004

Volltextzugriff (PDF)

Combinatorial Mathematics: Proceedings of the Second Australian Conference

1974

Volltextzugriff (PDF)

The Petersen Graph

1, 1993

Volltextzugriff (PDF)

Mathematical Reflections: In a Room with Many Mirrors

1, 1996

Volltextzugriff (PDF)

The Petersen graph

2010

Volltextzugriff (PDF)

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs

Graphs and combinatorics, 1999-12, Vol.15 (4), p.373-376

1999

Volltextzugriff (PDF)

Lower bound of cyclic edge connectivity for n-extendability of regular graphs

Discrete mathematics, 1993-03, Vol.112 (1), p.139-150

1993

Volltextzugriff (PDF)

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices

Journal of combinatorial theory. Series B, 1988-12, Vol.45 (3), p.305-319

1988

Volltextzugriff (PDF)

2-factors with prescribed and proscribed edges

Journal of graph theory, 2005-05, Vol.49 (1), p.48-58

2005

Volltextzugriff (PDF)

Combinatorial Mathematics II: Proceedings of the Second Australian Conference

1974 edition., 2006

Volltextzugriff (PDF)

Uniform cyclic edge connectivity in cubic graphs

Combinatorica (Budapest. 1981), 1991-06, Vol.11 (2), p.81-96

1991

Volltextzugriff (PDF)

Hamiltonian cycles in cubic 3-connected bipartite planar graphs

Journal of combinatorial theory. Series B, 1985-01, Vol.38 (3), p.279-297

1985

Volltextzugriff (PDF)

Sorting Classes

The Electronic journal of combinatorics, 2005-06, Vol.12 (1)

2005

Volltextzugriff (PDF)

On the 2-extendability of planar graphs

Discrete mathematics, 1991-12, Vol.96 (2), p.81-99

1991

Volltextzugriff (PDF)

Two results on matching extensions with prescribed and proscribed edge sets

Discrete mathematics, 1999-08, Vol.206 (1), p.35-43

1999

Volltextzugriff (PDF)

An 11-vertex theorem for 3-connected cubic graphs

Journal of graph theory, 1988-12, Vol.12 (4), p.561-570

1988

Volltextzugriff (PDF)

Mathematical Vistas: From a Room with Many Windows

1, 2002

Volltextzugriff (PDF)

No graph has a maximal 3-ring of bonds

Journal of combinatorial theory. Series B, 1985-01, Vol.38 (2), p.139-142

1985

Volltextzugriff (PDF)

1 – 25 von 1.158

Menü

Weitere Dienste

Einstellungen

Thinking like a mathematician: an example of discovery-based learning

Combinatorial Mathematics: Proceedings of the International Conference on Combinatorial Theory, Canberra, August 16 - 27 1977

Permuting machines and priority queues

M-alternating paths in n-extendable bipartite graphs

Nonhamiltonian 3-connected cubic planar graphs

Characterizing 2k-critical graphs and n-extendable graphs

Radiopaque markers in endovascular stents--benefit and potential hazards

Restricted permutations and queue jumping

Combinatorial Mathematics: Proceedings of the Second Australian Conference

The Petersen Graph

Mathematical Reflections: In a Room with Many Mirrors

The Petersen graph

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs

Lower bound of cyclic edge connectivity for n-extendability of regular graphs

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices

2-factors with prescribed and proscribed edges

Combinatorial Mathematics II: Proceedings of the Second Australian Conference

Uniform cyclic edge connectivity in cubic graphs

Hamiltonian cycles in cubic 3-connected bipartite planar graphs

Sorting Classes

On the 2-extendability of planar graphs

Two results on matching extensions with prescribed and proscribed edge sets

An 11-vertex theorem for 3-connected cubic graphs

Mathematical Vistas: From a Room with Many Windows

No graph has a maximal 3-ring of bonds

Suchergebnisse filtern