The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michel Mollard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Abdelhafid Berrachedi, Michel Mollard
    On two problems about (0, 2)-graphs and interval-regular graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:49, n:, pp:- [Journal]
  2. Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel
    A linear algorithm for minimum 1-identifying codes in oriented trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:8, pp:1246-1253 [Journal]
  3. Sylvain Gravier, Michel Mollard
    On Domination Numbers of Cartesian Product of Paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:247-250 [Journal]
  4. Tomás Dvorák, Ivan Havel, Michel Mollard
    On paths and cycles dominating hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:121-129 [Journal]
  5. Sylvain Gravier, Sandi Klavzar, Michel Mollard
    Isometric embeddings of subdivided wheels in hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:287-293 [Journal]
  6. Sylvain Gravier, Michel Mollard, Charles Payan
    On the nonexistence of three-dimensional tiling in the Lee metric II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:151-157 [Journal]
  7. Mohamed Kobeissi, Michel Mollard
    Spanning graphs of hypercubes: starlike and double starlike trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:231-239 [Journal]
  8. Mohamed Kobeissi, Michel Mollard
    Disjoint cycles and spanning graphs of hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:288, n:1-3, pp:73-87 [Journal]
  9. Sylvain Gravier, Michel Mollard, Charles Payan
    On the Non-existence of 3-Dimensional Tiling in the Lee Metric. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:5, pp:567-572 [Journal]
  10. Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Michel Mollard
    Hamming polynomials and their partial derivatives. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:4, pp:1156-1162 [Journal]
  11. François Jaeger, Abdelkader Khelladi, Michel Mollard
    On shortest cocycle covers of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:2, pp:153-163 [Journal]
  12. Michel Mollard
    Une nouvelle famille de 3-codes parfaits sur GF(q). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:2, pp:209-212 [Journal]
  13. Abdelhafid Berrachedi, Michel Mollard
    Median graphs and hypercubes, some new characterizations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:208, n:, pp:71-75 [Journal]
  14. Michel Mollard, Charles Payan
    Some progress in the packing of equal circles in a square. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:3, pp:303-307 [Journal]
  15. Michel Mollard
    Cycle-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:1, pp:29-41 [Journal]
  16. Michel Mollard
    Two characterizations of generalized hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:93, n:1, pp:63-74 [Journal]
  17. Michel Mollard
    Interval-regularity does not lead to interval motonicity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:233-237 [Journal]

  18. Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths. [Citation Graph (, )][DBLP]


  19. Weighted codes in Lee metrics. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002