The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Henry Meyniel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Henry Meyniel
    A note about a theorem by maamoun on decompositions of digraphs into elementary directed paths or cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:3, pp:368-370 [Journal]
  2. Henry Meyniel, Stephan Olariu
    A new conjecture about minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:244-247 [Journal]
  3. Henry Meyniel
    Les 5-colorations d'un graphe planaire forment une classe de commutation unique. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:24, n:3, pp:251-257 [Journal]
  4. Pierre Duchet, Henry Meyniel
    A note on kernel-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:1, pp:103-105 [Journal]
  5. Pierre Duchet, Henry Meyniel
    Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:21-27 [Journal]
  6. Malaz Maamoun, Henry Meyniel
    On a problem of G. Hahn about coloured hamiltonian paths in K2t. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:2, pp:213-214 [Journal]
  7. W. Bienia, Henry Meyniel
    Partitions of digraphs into paths or circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:329-331 [Journal]
  8. 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]
  9. Frédéric Maffray, Henry Meyniel
    On a relationship between Hadwiger and stability numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:1, pp:39-42 [Journal]
  10. Pierre Duchet, Yahya Ould Hamidoune, Henry Meyniel
    Sur les quasi-noyaux d'un graphe. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:3, pp:231-235 [Journal]
  11. Henry Meyniel, Jean-Pierre Roudneff
    The vertex picking game and a variation of the game of dots and boxes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:70, n:3, pp:311-313 [Journal]
  12. 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]
  13. Henry Meyniel
    About colorings, stability and paths in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:149-150 [Journal]
  14. Mostafa Blidia, Pierre Duchet, Henry Jacob, Frédéric Maffray, Henry Meyniel
    Some operations preserving the existence of kernels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:211-216 [Journal]
  15. Pierre Duchet, Henry Meyniel
    Kernels in directed graphs: a poison game. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:115, n:1-3, pp:273-276 [Journal]
  16. Henry Jacob, Henry Meyniel
    About quasi-kernels in a digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:154, n:1-3, pp:279-280 [Journal]

Search in 0.001secs, Finished in 0.002secs
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