default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Las Vergnas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j43]Emeric Gioan, Michel Las Vergnas:
Computing the fully optimal spanning tree of an ordered bipolar directed graph. Discret. Math. 347(5): 113895 (2024)
2010 – 2019
- 2019
- [j42]Emeric Gioan, Michel Las Vergnas:
The active bijection for graphs. Adv. Appl. Math. 104: 165-236 (2019) - 2013
- [j41]Michel Las Vergnas:
The Tutte polynomial of a morphism of matroids - 5. Derivatives as generating functions of Tutte activities. Eur. J. Comb. 34(8): 1390-1405 (2013)
2000 – 2009
- 2009
- [j40]Emeric Gioan, Michel Las Vergnas:
The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region. Eur. J. Comb. 30(8): 1868-1886 (2009) - [j39]Emeric Gioan, Michel Las Vergnas:
A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements. Electron. Notes Discret. Math. 34: 307-311 (2009) - 2008
- [j38]Michel Las Vergnas:
A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs. Electron. Notes Discret. Math. 31: 119-122 (2008) - 2007
- [j37]Emeric Gioan, Michel Las Vergnas:
Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids. Electron. Notes Discret. Math. 29: 365-371 (2007) - 2006
- [j36]Emeric Gioan, Michel Las Vergnas:
The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes. Electron. J. Comb. 11(2) (2006) - 2005
- [j35]Emeric Gioan, Michel Las Vergnas:
Activity preserving bijections between spanning trees and orientations in graphs. Discret. Math. 298(1-3): 169-188 (2005) - 2004
- [j34]Gwihen Etienne, Michel Las Vergnas:
The Tutte polynomial of a morphism of matroids: III. Vectorial matroids. Adv. Appl. Math. 32(1-2): 198-211 (2004) - [j33]Emeric Gioan, Michel Las Vergnas:
Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids. Adv. Appl. Math. 32(1-2): 212-238 (2004) - 2001
- [j32]Raul Cordovil, Michel Las Vergnas:
Foreword. Eur. J. Comb. 22(5): 577- (2001) - [j31]David Forge, Michel Las Vergnas:
Orlik-Solomon Type Algebras. Eur. J. Comb. 22(5): 699-704 (2001) - [j30]David Forge, Michel Las Vergnas, Peter Schuchert:
10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope. Eur. J. Comb. 22(5): 705-708 (2001) - [j29]Michel Las Vergnas:
Active Orders for Matroid Bases. Eur. J. Comb. 22(5): 709-721 (2001)
1990 – 1999
- 1998
- [j28]Gwihen Etienne, Michel Las Vergnas:
External and internal elements of a matroid basis. Discret. Math. 179(1-3): 111-119 (1998) - 1997
- [j27]Yahya Ould Hamidoune, Michel Las Vergnas:
Directed switching games II The Arborescence Game. Discret. Math. 165-166: 395-402 (1997) - 1996
- [j26]Raul Cordovil, António Guedes de Oliveira
, Michel Las Vergnas:
A generalized Desargues configuration and the pure braid group. Discret. Math. 160(1-3): 105-113 (1996) - 1990
- [j25]Michel Las Vergnas:
An upper bound for the number of Eulerian orientations of a regular graph. Comb. 10(1): 61-65 (1990) - [j24]Michel Las Vergnas:
Acyclic reorientations of weakly oriented matroids. J. Comb. Theory B 49(2): 195-199 (1990)
1980 – 1989
- 1988
- [j23]Yahya Ould Hamidoune, Michel Las Vergnas:
A solution to the Misère Shannon switching Game. Discret. Math. 72(1-3): 163-166 (1988) - [j22]Yahya Ould Hamidoune, Michel Las Vergnas:
Local edge-connectivity in regular bipartite graphs. J. Comb. Theory B 44(3): 370-371 (1988) - [j21]Michel Las Vergnas:
On the evaluation at (3, 3) of the Tutte polynomial of a graph. J. Comb. Theory B 45(3): 367-372 (1988) - 1987
- [j20]Yahya Ould Hamidoune, Michel Las Vergnas:
A solution to the Box Game. Discret. Math. 65(2): 157-171 (1987) - 1986
- [j19]Pierre Duchet, Michel Las Vergnas, Henry Meyniel:
Connected cutsets of a graph and triangle bases of the cycle space. Discret. Math. 62(2): 145-154 (1986) - [j18]Yahya Ould Hamidoune, Michel Las Vergnas:
Directed Switching Games on graphs and matroids. J. Comb. Theory B 40(3): 237-269 (1986) - [j17]Michel Las Vergnas:
Order properties of lines in the plane and a conjecture of G. Ringel. J. Comb. Theory B 41(2): 246-249 (1986) - 1984
- [j16]Jean-Claude Bermond, Michel Las Vergnas:
Regular factors in nearly regular graphs. Discret. Math. 50: 9-13 (1984) - [j15]Claude Berge, Michel Las Vergnas:
Transversals of circuits and acyclic orientations in graphs and matroids. Discret. Math. 50: 107-108 (1984) - 1983
- [j14]Pierre Duchet, Yahya Ould Hamidoune, Michel Las Vergnas, Henry Meyniel:
Representing a planar graph by vertical lines joining different levels. Discret. Math. 46(3): 319-321 (1983) - 1982
- [j13]François Bry, Michel Las Vergnas:
The Edmonds - Gallai decomposition for matchings in locally finite graphs. Comb. 2(3): 229-235 (1982) - 1981
- [j12]Michel Las Vergnas:
On products of matroids. Discret. Math. 36(1): 49-55 (1981) - [j11]Michel Las Vergnas, Henry Meyniel:
Kempe classes and the Hadwiger Conjecture. J. Comb. Theory B 31(3): 95-104 (1981) - 1980
- [j10]Michel Las Vergnas:
Fundamental circuits and a characterization of binary matroids. Discret. Math. 31(3): 327 (1980) - [j9]Michel Las Vergnas:
Convexity in oriented matroids. J. Comb. Theory B 29(2): 231-243 (1980)
1970 – 1979
- 1979
- [j8]Raul Cordovil, Michel Las Vergnas:
Geometries simpliciales unimodulaires. Discret. Math. 26(3): 213-217 (1979) - 1978
- [j7]Michel Las Vergnas:
An extension of Tutte's 1-factor theorem. Discret. Math. 23(3): 241-255 (1978) - [j6]Robert G. Bland, Michel Las Vergnas:
Orientability of matroids. J. Comb. Theory B 24(1): 94-123 (1978) - [j5]Michel Las Vergnas:
Bases in oriented matroids. J. Comb. Theory B 25(3): 283-289 (1978) - 1977
- [j4]Michel Las Vergnas:
Acyclic and totally cyclic orientations of combinatorial geometries. Discret. Math. 20: 51-61 (1977) - 1976
- [j3]Michel Las Vergnas:
Sur les arborescences dans un graphe oriente. Discret. Math. 15(1): 27-39 (1976) - 1974
- [j2]J.-C. Fournier, Michel Las Vergnas:
Une classe d'hypergraphes bichromatiques II. Discret. Math. 7(1-2): 99-106 (1974) - 1972
- [j1]J.-C. Fournier, Michel Las Vergnas:
Une classe d'hypergraphes bichromatiques. Discret. Math. 2(4): 407-410 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
