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

Connection between the membrane electron transport system and Hyn hydrogenase in the purple sulfur bacterium, Thiocapsa roseopersicina BBS

Biochimica et biophysica acta, 2014-10, Vol.1837 (10), p.1691-1698

2014

Volltextzugriff (PDF)

Optimal pebbling and rubbling of graphs with given diameter

Discrete Applied Mathematics, 2019-08, Vol.266, p.340-345

2019

Volltextzugriff (PDF)

Connected graphs without long paths

Discrete mathematics, 2008-10, Vol.308 (19), p.4487-4494

2008

Volltextzugriff (PDF)

Adjacent Vertex Distinguishing Edge‐Colorings

SIAM journal on discrete mathematics, 2007-01, Vol.21 (1), p.237-250

2007

Volltextzugriff (PDF)

Coloring vertices and edges of a graph by nonempty subsets of a set

European journal of combinatorics, 2011-05, Vol.32 (4), p.533-537

2011

Volltextzugriff (PDF)

OP7: Silk Fibroin-Based Conduits Filled with Native Spider Silk Fibers Successfully Promoted Nerve Regeneration in a 10 Mm Sciatic Nerve Defect in Rats

Plastic and reconstructive surgery. Global open, 2022-01, Vol.10 (1S), p.4-4

2022

Volltextzugriff (PDF)

Nearly bipartite graphs

Discrete mathematics, 2003-11, Vol.272 (2), p.187-196

2003

Volltextzugriff (PDF)

Triangle-Free Hypergraphs

Combinatorics, probability & computing, 2006-01, Vol.15 (1-2), p.185-191

GYORI, ERVIN

2006

Volltextzugriff (PDF)

Horizons of Combinatorics

1. Aufl., 2008

Volltextzugriff (PDF)

Covering simply connected regions by rectangles

Combinatorica (Budapest. 1981), 1985-01, Vol.5 (1), p.53-55

GYORI, E

1985

Volltextzugriff (PDF)

A nine vertex theorem for 3-connected claw- free graphs

Studia scientiarum mathematicarum Hungarica, 2002, Vol.38 (1-4), p.233-244

2002

Volltextzugriff (PDF)

Site effect determination at liquefiable sites

Acta geodaetica et geophysica Hungarica, 2006-03, Vol.41 (1), p.117-132

Győri, E

2006

Volltextzugriff (PDF)

VARIETY IDENTIFICATION BY COMPUTER VISION

Acta horticulturae, 2001 (562), p.341-345

2001

Volltextzugriff (PDF)

k -Step Sum and m -Step Gap Fibonacci Sequence

ISRN discrete mathematics, 2014-01, Vol.2014, p.1-7

2014

Volltextzugriff (PDF)

On the number ofC 5′S in a triangle-free graph

Combinatorica (Budapest. 1981), 1989-03, Vol.9 (1), p.101-102

Győri, E.

1989

Volltextzugriff (PDF)

On the structures induced by bipartite graphs and infinite matroids

Discrete mathematics, 1978, Vol.22 (3), p.257-261

Győri, E.

1978

Volltextzugriff (PDF)

Liquefaction and post-liquefaction settlement assessment — A probabilistic approach

Acta geodaetica et geophysica Hungarica, 2011-09, Vol.46 (3), p.347-369

2011

Volltextzugriff (PDF)

The number of small semispaces of a finite set of points in the plane

Journal of combinatorial theory. Series A, 1986, Vol.41 (1), p.154-157

1986

Volltextzugriff (PDF)

On the edge numbers of graphs with hadwiger number 4 and 5

Periodica mathematica Hungarica, 1982-03, Vol.13 (1), p.21-27

Győri, E.

1982

Volltextzugriff (PDF)

Unsuspected central nervous system gummas in a case of "cerebral infarct" associated with cocaine use

The American journal of forensic medicine and pathology, 2007-09, Vol.28 (3), p.208-211

2007

Volltextzugriff (PDF)

Prolonged survival without neurologic deficit following traumatic dorsolateral brainstem injury

Clinical neuropathology, 1985-05, Vol.4 (3), p.121

Gyori, E

1985

Volltextzugriff (PDF)

How to make a graph four-connected

Mathematical programming, 1999-04, Vol.84 (3), p.555-563

1999

Volltextzugriff (PDF)

Longest Paths in Circular Arc Graphs

Combinatorics, probability & computing, 2004-05, Vol.13 (3), p.311-317

2004

Volltextzugriff (PDF)

A minimax theorem on intervals

Journal of combinatorial theory. Series B, 1984-01, Vol.37 (1), p.1-9

Györi, Ervin

1984

Volltextzugriff (PDF)

On the Strong Product of a k-Extendable and an l-Extendable Graph

Graphs and combinatorics, 2001-01, Vol.17 (2), p.245-253

2001

Volltextzugriff (PDF)

1 – 25 von 174

Menü

Weitere Dienste

Einstellungen

Connection between the membrane electron transport system and Hyn hydrogenase in the purple sulfur bacterium, Thiocapsa roseopersicina BBS

Optimal pebbling and rubbling of graphs with given diameter

Connected graphs without long paths

Adjacent Vertex Distinguishing Edge‐Colorings

Coloring vertices and edges of a graph by nonempty subsets of a set

OP7: Silk Fibroin-Based Conduits Filled with Native Spider Silk Fibers Successfully Promoted Nerve Regeneration in a 10 Mm Sciatic Nerve Defect in Rats

Nearly bipartite graphs

Triangle-Free Hypergraphs

Horizons of Combinatorics

Covering simply connected regions by rectangles

A nine vertex theorem for 3-connected claw- free graphs

Site effect determination at liquefiable sites

VARIETY IDENTIFICATION BY COMPUTER VISION

k -Step Sum and m -Step Gap Fibonacci Sequence

On the number ofC 5′S in a triangle-free graph

On the structures induced by bipartite graphs and infinite matroids

Liquefaction and post-liquefaction settlement assessment — A probabilistic approach

The number of small semispaces of a finite set of points in the plane

On the edge numbers of graphs with hadwiger number 4 and 5

Unsuspected central nervous system gummas in a case of "cerebral infarct" associated with cocaine use

Prolonged survival without neurologic deficit following traumatic dorsolateral brainstem injury

How to make a graph four-connected

Longest Paths in Circular Arc Graphs

A minimax theorem on intervals

On the Strong Product of a k-Extendable and an l-Extendable Graph

Suchergebnisse filtern