Charles Payan

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2007

A generalization of the pentomino exclusion problem: Dislocation of graphs.

Sylvain Gravier, Julien Moncel, Charles Payan

Discret. Math., 2007

2006

Quantum Octal Games.

Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan

Int. J. Found. Comput. Sci., 2006

2002

Three Moves on Signed Surface Triangulations.

Shalom Eliahou, Sylvain Gravier, Charles Payan

J. Comb. Theory, Ser. B, 2002

Flips Signés et Triangulations d'un Polygone.

Sylvain Gravier, Charles Payan

Eur. J. Comb., 2002

2001

On the nonexistence of three-dimensional tiling in the Lee metric II.

Sylvain Gravier, Michel Mollard, Charles Payan

Discret. Math., 2001

On the Pentomino Exclusion Problem.

Sylvain Gravier, Charles Payan

Discret. Comput. Geom., 2001

1999

Domination Number of the Cross Product of Paths.

Rachid Chérifi, Sylvain Gravier, Xavier Lagraula, Charles Payan, Ismaïl Zighem

Discret. Appl. Math., 1999

1998

On the Non-existence of 3-Dimensional Tiling in the Lee Metric.

Sylvain Gravier, Michel Mollard, Charles Payan

Eur. J. Comb., 1998

1997

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

Charles Payan

Discret. Math., 1997

Une caracterisation des produits d'arbres et des grilles.

Stefan Janaqi, Charles Payan

Discret. Math., 1997

1996

A Property on Edge-disjoint Spanning Trees.

Hong-Jian Lai, Hongyuan Lai, Charles Payan

Eur. J. Comb., 1996

1992

Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties.

François Jaeger, Nathan Linial, Charles Payan, Michael Tarsi

J. Comb. Theory, Ser. B, 1992

Sur l'immersion gracieuse de K_N dans Q_n.

Shixin Sun, Charles Payan

Discret. Math., 1992

On the chromatic number of cube-like graphs.

Charles Payan

Discret. Math., 1992

1990

Some progress in the packing of equal circles in a square.

Michel Mollard, Charles Payan

Discret. Math., 1990

1989

On Two Conjectures About Set-graceful Graphs.

Michel Mollard, Charles Payan

Eur. J. Comb., 1989

1986

Graphes Équilibrés et Arboricité Rationnelle.

Charles Payan

Eur. J. Comb., 1986

1984

Generalized <i>n</i>-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton.

Abdelkader Khelladi, Charles Payan

J. Comb. Theory, Ser. B, 1984

Arbres avec un nombre maximum de sommets pendants.

Charles Payan, Maurice Tchuenté, Nguyen Huy Xuong

Discret. Math., 1984

1983

Perfectness and dilworth number.

Charles Payan

Discret. Math., 1983

Partition of odd regular graphs into bistars.

François Jaeger, Charles Payan, Mekkia Kouider

Discret. Math., 1983

1982

Domination-balanced graphs.

Charles Payan, Nguyen Huy Xuong

J. Graph Theory, 1982

On digraphs without antidirected cycles.

Douglas D. Grant, François Jaeger, Charles Payan

J. Graph Theory, 1982

1980

A class of threshold and domishold graphs: equistable and equidominating graphs.

Charles Payan

Discret. Math., 1980

1979

A class of upper-embeddable graphs.

François Jaeger, Charles Payan, Nguyen Huy Xuong

J. Graph Theory, 1979

Upper embeddability and connectivity of graphs.

Charles Payan, Nguyen Huy Xuong

Discret. Math., 1979

1977

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

Charles Payan

, 1977

1966

Contribution à la réalisation d'un prototype d'analyseur différentiel digital.

Charles Payan

PhD thesis, 1966