International audienceIn this paper, we describe the circuit polytope on series–parallel graphs. We first show the existence of a compact extended formulation. Though not being explicit, its construction process helps us to inductively provide the description in the original space. As a consequence, using the link between bonds and circuits in planar graphs, we also describe the bond polytope on series–parallel graphs
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
Abstract. We study the question of polytopality of graphs: when is a given graph the graph of a poly...
AbstractLet G be connected, finite graph. Let C be a circuit of G. β(C), the strong bridge graph of ...
International audienceIn this paper, we describe the circuit polytope on series–parallel graphs. We ...
International audienceIn this paper, we describe the circuit polytope on series–parallel graphs. We ...
International audienceThe st-bond polytope of a graph is the convex hull of the incidence vectors of...
International audienceThe st-bond polytope of a graph is the convex hull of the incidence vectors of...
The st-bond polytope of a graph is the convex hull of the incidence vectors of its st-bonds, where a...
The st-bond polytope of a graph is the convex hull of the incidence vectors of its st-bonds, where a...
International audienceBy integrating in the representation of electrical circuits the properties of ...
AbstractGiven the graph of a 3-dimensional convex polytope, a circuit can be found through any speci...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
AbstractThis paper discusses an attempt at identifying a property of circuits in (nonplanar) graphs ...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs with ...
Abstract. We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, ...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
Abstract. We study the question of polytopality of graphs: when is a given graph the graph of a poly...
AbstractLet G be connected, finite graph. Let C be a circuit of G. β(C), the strong bridge graph of ...
International audienceIn this paper, we describe the circuit polytope on series–parallel graphs. We ...
International audienceIn this paper, we describe the circuit polytope on series–parallel graphs. We ...
International audienceThe st-bond polytope of a graph is the convex hull of the incidence vectors of...
International audienceThe st-bond polytope of a graph is the convex hull of the incidence vectors of...
The st-bond polytope of a graph is the convex hull of the incidence vectors of its st-bonds, where a...
The st-bond polytope of a graph is the convex hull of the incidence vectors of its st-bonds, where a...
International audienceBy integrating in the representation of electrical circuits the properties of ...
AbstractGiven the graph of a 3-dimensional convex polytope, a circuit can be found through any speci...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
AbstractThis paper discusses an attempt at identifying a property of circuits in (nonplanar) graphs ...
Molecular graphs able to model covalent multiple bonds are called plerographs. For such graphs with ...
Abstract. We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, ...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
Abstract. We study the question of polytopality of graphs: when is a given graph the graph of a poly...
AbstractLet G be connected, finite graph. Let C be a circuit of G. β(C), the strong bridge graph of ...