Charles Payan

According to our database1, Charles Payan authored at least 28 papers between 1966 and 2007.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
A generalization of the pentomino exclusion problem: Dislocation of graphs.
Discret. Math., 2007

2006
Quantum Octal Games.
Int. J. Found. Comput. Sci., 2006

2002
Three Moves on Signed Surface Triangulations.
J. Comb. Theory B, 2002

Flips Signés et Triangulations d'un Polygone.
Eur. J. Comb., 2002

2001
On the nonexistence of three-dimensional tiling in the Lee metric II.
Discret. Math., 2001

On the Pentomino Exclusion Problem.
Discret. Comput. Geom., 2001

1999
Domination Number of the Cross Product of Paths.
Discret. Appl. Math., 1999

1998
On the Non-existence of 3-Dimensional Tiling in the Lee Metric.
Eur. J. Comb., 1998

1997
Empilement de cercles égaux dans un triangle équilatéral a propos d'une conjecture d'Erdös-Oler.
Discret. Math., 1997

Une caracterisation des produits d'arbres et des grilles.
Discret. Math., 1997

1996
A Property on Edge-disjoint Spanning Trees.
Eur. J. Comb., 1996

1992
Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties.
J. Comb. Theory B, 1992

Sur l'immersion gracieuse de K<sub>N</sub> dans Q<sub>n</sub>.
Discret. Math., 1992

On the chromatic number of cube-like graphs.
Discret. Math., 1992

1990
Some progress in the packing of equal circles in a square.
Discret. Math., 1990

1989
On Two Conjectures About Set-graceful Graphs.
Eur. J. Comb., 1989

1986
Graphes Équilibrés et Arboricité Rationnelle.
Eur. J. Comb., 1986

1984
Generalized <i>n</i>-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton.
J. Comb. Theory B, 1984

Arbres avec un nombre maximum de sommets pendants.
Discret. Math., 1984

1983
Perfectness and dilworth number.
Discret. Math., 1983

Partition of odd regular graphs into bistars.
Discret. Math., 1983

1982
Domination-balanced graphs.
J. Graph Theory, 1982

On digraphs without antidirected cycles.
J. Graph Theory, 1982

1980
A class of threshold and domishold graphs: equistable and equidominating graphs.
Discret. Math., 1980

1979
A class of upper-embeddable graphs.
J. Graph Theory, 1979

Upper embeddability and connectivity of graphs.
Discret. Math., 1979

1977
Sur quelques problèmes de couverture et de couplage en combinatoire.
, 1977

1966
Contribution à la réalisation d'un prototype d'analyseur différentiel digital.
PhD thesis, 1966


  Loading...