Michel Las Vergnas

According to our database1, Michel Las Vergnas authored at least 42 papers between 1972 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
The active bijection for graphs.
Adv. Appl. Math., 2019

2013
The Tutte polynomial of a morphism of matroids - 5. Derivatives as generating functions of Tutte activities.
Eur. J. Comb., 2013

2009
A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements.
Electron. Notes Discret. Math., 2009

The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region.
Eur. J. Comb., 2009

2008
A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs.
Electron. Notes Discret. Math., 2008

2007
Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids.
Electron. Notes Discret. Math., 2007

2006
The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes.
Electron. J. Comb., 2006

2005
Activity preserving bijections between spanning trees and orientations in graphs.
Discret. Math., 2005

2004
Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids.
Adv. Appl. Math., 2004

The Tutte polynomial of a morphism of matroids: III. Vectorial matroids.
Adv. Appl. Math., 2004

2001
Active Orders for Matroid Bases.
Eur. J. Comb., 2001

10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope.
Eur. J. Comb., 2001

Orlik-Solomon Type Algebras.
Eur. J. Comb., 2001

Foreword.
Eur. J. Comb., 2001

1998
External and internal elements of a matroid basis.
Discret. Math., 1998

1997
Directed switching games II The Arborescence Game.
Discret. Math., 1997

1996
A generalized Desargues configuration and the pure braid group.
Discret. Math., 1996

1990
Acyclic reorientations of weakly oriented matroids.
J. Comb. Theory, Ser. B, 1990

An upper bound for the number of Eulerian orientations of a regular graph.
Comb., 1990

1988
On the evaluation at (3, 3) of the Tutte polynomial of a graph.
J. Comb. Theory, Ser. B, 1988

Local edge-connectivity in regular bipartite graphs.
J. Comb. Theory, Ser. B, 1988

A solution to the Misère Shannon switching Game.
Discret. Math., 1988

1987
A solution to the Box Game.
Discret. Math., 1987

1986
Order properties of lines in the plane and a conjecture of G. Ringel.
J. Comb. Theory, Ser. B, 1986

Directed Switching Games on graphs and matroids.
J. Comb. Theory, Ser. B, 1986

Connected cutsets of a graph and triangle bases of the cycle space.
Discret. Math., 1986

1984
Regular factors in nearly regular graphs.
Discret. Math., 1984

Transversals of circuits and acyclic orientations in graphs and matroids.
Discret. Math., 1984

1983
Representing a planar graph by vertical lines joining different levels.
Discret. Math., 1983

1982
The Edmonds - Gallai decomposition for matchings in locally finite graphs.
Comb., 1982

1981
Kempe classes and the Hadwiger Conjecture.
J. Comb. Theory, Ser. B, 1981

On products of matroids.
Discret. Math., 1981

1980
Convexity in oriented matroids.
J. Comb. Theory, Ser. B, 1980

Fundamental circuits and a characterization of binary matroids.
Discret. Math., 1980

1979
Geometries simpliciales unimodulaires.
Discret. Math., 1979

1978
Bases in oriented matroids.
J. Comb. Theory, Ser. B, 1978

Orientability of matroids.
J. Comb. Theory, Ser. B, 1978

An extension of Tutte's 1-factor theorem.
Discret. Math., 1978

1977
Acyclic and totally cyclic orientations of combinatorial geometries.
Discret. Math., 1977

1976
Sur les arborescences dans un graphe oriente.
Discret. Math., 1976

1974
Une classe d'hypergraphes bichromatiques II.
Discret. Math., 1974

1972
Une classe d'hypergraphes bichromatiques.
Discret. Math., 1972


  Loading...