The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michel Las Vergnas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. François Bry, Michel Las Vergnas
    The Edmonds - Gallai decomposition for matchings in locally finite graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:3, pp:229-235 [Journal]
  2. Michel Las Vergnas
    An upper bound for the number of Eulerian orientations of a regular graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:61-65 [Journal]
  3. Emeric Gioan, Michel Las Vergnas
    Activity preserving bijections between spanning trees and orientations in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:298, n:1-3, pp:169-188 [Journal]
  4. Raul Cordovil, Michel Las Vergnas
    Foreword. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:5, pp:577-0 [Journal]
  5. David Forge, Michel Las Vergnas
    Orlik-Solomon Type Algebras. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:5, pp:699-704 [Journal]
  6. David Forge, Michel Las Vergnas, Peter Schuchert
    10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:5, pp:705-708 [Journal]
  7. Michel Las Vergnas
    Active Orders for Matroid Bases. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:5, pp:709-721 [Journal]
  8. Yahya Ould Hamidoune, Michel Las Vergnas
    Directed Switching Games on graphs and matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:3, pp:237-269 [Journal]
  9. Yahya Ould Hamidoune, Michel Las Vergnas
    Local edge-connectivity in regular bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:3, pp:370-371 [Journal]
  10. Michel Las Vergnas
    Order properties of lines in the plane and a conjecture of G. Ringel. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:2, pp:246-249 [Journal]
  11. Michel Las Vergnas
    On the evaluation at (3, 3) of the Tutte polynomial of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:3, pp:367-372 [Journal]
  12. Michel Las Vergnas
    Acyclic reorientations of weakly oriented matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:49, n:2, pp:195-199 [Journal]
  13. Michel Las Vergnas
    Convexity in oriented matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:29, n:2, pp:231-243 [Journal]
  14. Michel Las Vergnas
    Bases in oriented matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:283-289 [Journal]
  15. Robert G. Bland, Michel Las Vergnas
    Orientability of matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:24, n:1, pp:94-123 [Journal]
  16. Michel Las Vergnas
    Fundamental circuits and a characterization of binary matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:31, n:3, pp:327- [Journal]
  17. Michel Las Vergnas
    On products of matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:36, n:1, pp:49-55 [Journal]
  18. Pierre Duchet, Michel Las Vergnas, Henry Meyniel
    Connected cutsets of a graph and triangle bases of the cycle space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:2, pp:145-154 [Journal]
  19. Yahya Ould Hamidoune, Michel Las Vergnas
    A solution to the Box Game. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:2, pp:157-171 [Journal]
  20. Pierre Duchet, Yahya Ould Hamidoune, Michel Las Vergnas, Henry Meyniel
    Representing a planar graph by vertical lines joining different levels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:3, pp:319-321 [Journal]
  21. C. Berge, Michel Las Vergnas
    Transversals of circuits and acyclic orientations in graphs and matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:107-108 [Journal]
  22. Jean-Claude Bermond, Michel Las Vergnas
    Regular factors in nearly regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:9-13 [Journal]
  23. Yahya Ould Hamidoune, Michel Las Vergnas
    A solution to the Misère Shannon switching Game. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:163-166 [Journal]
  24. Gwihen Etienne, Michel Las Vergnas
    External and internal elements of a matroid basis. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:179, n:1-3, pp:111-119 [Journal]
  25. Yahya Ould Hamidoune, Michel Las Vergnas
    Directed switching games II The Arborescence Game. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:395-402 [Journal]
  26. Raul Cordovil, António Guedes de Oliveira, Michel Las Vergnas
    A generalized Desargues configuration and the pure braid group. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:105-113 [Journal]

  27. The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.305secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002