Search the dblp DataBase

Publications of Author

1. Rachid Chérifi, Sylvain Gravier, Xavier Lagraula, Charles Payan, Ismaïl Zighem
   Domination Number of the Cross Product of Paths. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:101-139 [Journal]
   
2. Sylvain Gravier, Charles Payan
   On the Pentomino Exclusion Problem. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2001, v:26, n:3, pp:375-386 [Journal]
   
3. 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]
   
4. Sylvain Gravier, Julien Moncel, Charles Payan
   A generalization of the pentomino exclusion problem: Dislocation of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:3-5, pp:435-444 [Journal]
   
5. 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]
   
6. Sylvain Gravier, Charles Payan
   Flips Signés et Triangulations d'un Polygone. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 2002, v:23, n:7, pp:817-821 [Journal]
   
7. Hong-Jian Lai, Hongyuan Lai, Charles Payan
   A Property on Edge-disjoint Spanning Trees. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:5, pp:447-450 [Journal]
   
8. Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan
   Quantum Octal Games. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2006, v:17, n:4, pp:919-932 [Journal]
   
9. Shalom Eliahou, Sylvain Gravier, Charles Payan
   Three Moves on Signed Surface Triangulations. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2002, v:84, n:1, pp:118-125 [Journal]
   
10. François Jaeger, Nathan Linial, Charles Payan, Michael Tarsi
    Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:2, pp:165-182 [Journal]
    
11. Abdelkader Khelladi, Charles Payan
    Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:283-289 [Journal]
    
12. Charles Payan
    Perfectness and dilworth number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:2, pp:229-230 [Journal]
    
13. François Jaeger, Charles Payan, Mekkia Kouider
    Partition of odd regular graphs into bistars. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:1, pp:93-94 [Journal]
    
14. Stefan Janaqi, Charles Payan
    Une caracterisation des produits d'arbres et des grilles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:201-208 [Journal]
    
15. Charles Payan
    Empilement de cercles égaux dans un triangle équilatéral a propos d'une conjecture d'Erdös-Oler. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:555-565 [Journal]
    
16. 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]
    
17. Shixin Sun, Charles Payan
    Sur l'immersion gracieuse de K_N dans Q_n. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:1, pp:79-83 [Journal]
    
18. Charles Payan
    On the chromatic number of cube-like graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:3, pp:271-277 [Journal]