• Publications
  • Influence
Reseaux électriques planaires II
Nutzungsbedingungen Mit dem Zugriff auf den vorliegenden Inhalt gelten die Nutzungsbedingungen als akzeptiert. Die angebotenen Dokumente stehen für nicht-kommerzielle Zwecke in Lehre, Forschung undExpand
  • 75
  • 7
Ring graphs and complete intersection toric ideals
TLDR
We study the family of graphs whose number of primitive cycles equals its cycle rank. Expand
  • 40
  • 5
  • PDF
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
A graph is YΔY-reducible if it can be reduced to a vertex by a sequence of series-parallel reductions and YΔY-transformations. Terminals are distinguished vertices, that cannot be deleted byExpand
  • 18
  • 4
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
TLDR
We show that four-terminal planar graphs are Y Y-reducible when at least three of the vertices lie on the same face. Expand
  • 9
  • 2
Bounds For Invariants of Edge-Rings
ABSTRACT Let G be a simple graph with |V(G)| = n and no isolated vertices. Let α be its stability number. We study invariants of the edge-ring of G that can be interpreted as invariants of G. If GExpand
  • 34
  • 2
A Note on Rees Algebras and the MFMC Property
We study irreducible representations of Rees cones and char- acterize the max-flow min-cut property of clutters in terms of the nor- mality of Rees algebras and the integrality of certain polyhedra.Expand
  • 40
  • 2
  • PDF
The crossing number of a projective graph is quadratic in the face-width
TLDR
We show that for each integer g 0 there is a constant cg > 0 such that every graph that embeds in the projective plane with sucien tly large facewidth r has crossing number at least cgr 2 in the orientable surface g of genus g. Expand
  • 21
  • 1
  • PDF
On terminal delta-wye reducibility of planar graphs
TLDR
We prove terminal Δ-Y reducibility of planar graphs with at most three terminals. Expand
  • 13
  • 1
  • PDF
Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems
Let I = (x v 1 , . . . , x v q ) be a square-free monomial ideal of a polynomial ring K[x1, . . . , xn] over an arbitrary field K and let A be the incidence matrix with column vectors v1, . . . , vq.Expand
  • 37
  • 1
  • PDF
...
1
2
3
4
5
...