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

Evolution of a designless nanoparticle network into reconfigurable Boolean logic

Nature nanotechnology, 2015-12, Vol.10 (12), p.1048-1052

2015

Volltextzugriff (PDF)

How Many Conjectures Can You Stand? A Survey

Graphs and combinatorics, 2012-01, Vol.28 (1), p.57-75

2012

Volltextzugriff (PDF)

Best Monotone Degree Conditions for Graph Properties: A Survey

Graphs and combinatorics, 2015-01, Vol.31 (1), p.1-22

2015

Volltextzugriff (PDF)

On hamiltonicity of P3-dominated graphs

Mathematical methods of operations research (Heidelberg, Germany), 2009-05, Vol.69 (2), p.297-306

2009

Volltextzugriff (PDF)

Tank-Ring Factors in Supereulerian Claw-Free Graphs

Graphs and combinatorics, 2013-05, Vol.29 (3), p.599-608

2013

Volltextzugriff (PDF)

Not every 2-tough graph is Hamiltonian

Discrete Applied Mathematics, 2000-02, Vol.99 (1), p.317-321

2000

Volltextzugriff (PDF)

Degree Sequences and the Existence of k-Factors

Graphs and combinatorics, 2012-03, Vol.28 (2), p.149-166

2012

Volltextzugriff (PDF)

Path-fan Ramsey numbers

Discrete Applied Mathematics, 2006-06, Vol.154 (9), p.1429-1436

2006

Volltextzugriff (PDF)

Subpancyclicity of line graphs and degree sums along paths

Discrete Applied Mathematics, 2006-06, Vol.154 (9), p.1453-1463

2006

Volltextzugriff (PDF)

Toughness and Vertex Degrees

Journal of graph theory, 2013-02, Vol.72 (2), p.209-219

2013

Volltextzugriff (PDF)

The hamiltonian index of a graph and its branch-bonds

Discrete mathematics, 2004-08, Vol.285 (1), p.279-288

2004

Volltextzugriff (PDF)

A note on minimum degree conditions for supereulerian graphs

Discrete Applied Mathematics, 2002-08, Vol.120 (1), p.35-43

2002

Volltextzugriff (PDF)

A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs

Discrete Applied Mathematics, 2000-02, Vol.99 (1), p.367-400

2000

Volltextzugriff (PDF)

On hamiltonicity of P 3-dominated graphs

Mathematical methods of operations research (Heidelberg, Germany), 2009-05, Vol.69 (2), p.297-306

2009

Volltextzugriff (PDF)

On factors of 4-connected claw-free graphs

Journal of graph theory, 2001-06, Vol.37 (2), p.125-136

2001

Volltextzugriff (PDF)

A generalization of AT-free graphs and a generic algorithm for solving triangulation problems

Algorithmica, 2002-04, Vol.32 (4), p.594-610

2002

Volltextzugriff (PDF)

Connected even factors in claw-free graphs

Discrete mathematics, 2008-06, Vol.308 (11), p.2282-2284

2008

Volltextzugriff (PDF)

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion

Discrete Applied Mathematics, 2002-08, Vol.120 (1), p.13-23

2002

Volltextzugriff (PDF)

Some approaches to a conjecture on short cycles in digraphs

Discrete Applied Mathematics, 2002-08, Vol.120 (1), p.45-53

2002

Volltextzugriff (PDF)

Path–kipas Ramsey numbers

Discrete Applied Mathematics, 2007-09, Vol.155 (14), p.1878-1884

2007

Volltextzugriff (PDF)

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

Discrete Applied Mathematics, 2007-05, Vol.155 (10), p.1336-1343

2007

Volltextzugriff (PDF)

On Ramsey numbers for paths versus wheels

Discrete mathematics, 2007-04, Vol.307 (7), p.975-982

2007

Volltextzugriff (PDF)

Degree sums and subpancyclicity in line graphs

Discrete mathematics, 2002, Vol.242 (1), p.255-267

2002

Volltextzugriff (PDF)

On-Line Coloring of H-Free Bipartite Graphs

Algorithms and Complexity, 2006, p.284-295

2006

Volltextzugriff (PDF)

Cycles through particular subgraphs of claw-free graphs

Journal of graph theory, 1995-12, Vol.20 (4), p.459-465

1995

Volltextzugriff (PDF)

1 – 25 von 117

Menü

Weitere Dienste

Einstellungen

Evolution of a designless nanoparticle network into reconfigurable Boolean logic

How Many Conjectures Can You Stand? A Survey

Best Monotone Degree Conditions for Graph Properties: A Survey

On hamiltonicity of P3-dominated graphs

Tank-Ring Factors in Supereulerian Claw-Free Graphs

Not every 2-tough graph is Hamiltonian

Degree Sequences and the Existence of k-Factors

Path-fan Ramsey numbers

Subpancyclicity of line graphs and degree sums along paths

Toughness and Vertex Degrees

The hamiltonian index of a graph and its branch-bonds

A note on minimum degree conditions for supereulerian graphs

A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs

On hamiltonicity of P 3-dominated graphs

On factors of 4-connected claw-free graphs

A generalization of AT-free graphs and a generic algorithm for solving triangulation problems

Connected even factors in claw-free graphs

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion

Some approaches to a conjecture on short cycles in digraphs

Path–kipas Ramsey numbers

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

On Ramsey numbers for paths versus wheels

Degree sums and subpancyclicity in line graphs

On-Line Coloring of H-Free Bipartite Graphs

Cycles through particular subgraphs of claw-free graphs

Suchergebnisse filtern