output
20022009
most citedExciton binding energies in carbon nanotubes from two-photon photoluminescence

514 citations

Showing 2007 · math.COShow all

8 papers · 2 filters

math.CO2007

Drawing polytopal graphs with polymake

Ewgenij Gawrilow, Michael Joswig, Thilo Rörig +1

This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric…

math.CO2007

Linkages in Polytope Graphs

Axel Werner, Ronald F. Wotzlaw

A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact value…

math.CO20072 cited

On cardinality constrained cycle and path polytopes

Volker Kaibel, Ruediger Stephan

Given a directed graph D = (N, A) and a sequence of positive integers 1 <= c_1 < c_2 < ... < c_m <= |N|, we consider those path and cycle polytopes that are defined as the convex h…

math.CO2007

Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms

Paul Bonsma, Florian Zickfeld

It is known that graphs on n vertices with minimum degree at least 3 have spanning trees with at least n/4+2 leaves and that this can be improved to (n+4)/3 for cubic graphs withou…

math.CO2007

Constructing Simplicial Branched Covers

Nikolaus Witte

Branched covers are applied frequently in topology - most prominently in the construction of closed oriented PL d-manifolds. In particular, strong bounds for the number of sheets a…

math.CO20074 cited

Homotopy groups of Hom complexes of graphs

Anton Dochtermann

The notion of -homotopy from \cite{DocHom} is investigated in the context of the category of pointed graphs. The main result is a long exact sequence that relates the highe…