Charles Payan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2007

A generalization of the pentomino exclusion problem: Dislocation of graphsSylvain Gravier, Julien Moncel, Charles Payan. DM, 307(3-5):435-444, 2007. [doi]

2006

Quantum Octal GamesSylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan. ijfcs, 17(4):919-932, 2006. [doi]

2002

Three Moves on Signed Surface TriangulationsShalom Eliahou, Sylvain Gravier, Charles Payan. JCT, 84(1):118-125, 2002. [doi]

Flips Signés et Triangulations d un PolygoneSylvain Gravier, Charles Payan. ejc, 23(7):817-821, 2002. [doi]

2001

On the Pentomino Exclusion ProblemSylvain Gravier, Charles Payan. dcg, 26(3):375-386, 2001. [doi]

On the nonexistence of three-dimensional tiling in the Lee metric IISylvain Gravier, Michel Mollard, Charles Payan. DM, 235(1-3):151-157, 2001. [doi]

1999

Domination Number of the Cross Product of PathsRachid Chérifi, Sylvain Gravier, Xavier Lagraula, Charles Payan, Ismaïl Zighem. DAM, 94(1-3):101-139, 1999. [doi]

1998

On the Non-existence of 3-Dimensional Tiling in the Lee MetricSylvain Gravier, Michel Mollard, Charles Payan. ejc, 19(5):567-572, 1998. [doi]

1997

Une caracterisation des produits d arbres et des grillesStefan Janaqi, Charles Payan. DM, 163(1-3):201-208, 1997. [doi]

Empilement de cercles égaux dans un triangle équilatéral a propos d une conjecture d Erdös-OlerCharles Payan. DM, 165-166:555-565, 1997. [doi]

1996

A Property on Edge-disjoint Spanning TreesHong-Jian Lai, Hongyuan Lai, Charles Payan. ejc, 17(5):447-450, 1996. [doi]

1992

Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow propertiesFrançois Jaeger, Nathan Linial, Charles Payan, Michael Tarsi. JCT, 56(2):165-182, 1992. [doi]

On the chromatic number of cube-like graphsCharles Payan. DM, 103(3):271-277, 1992. [doi]

Sur l immersion gracieuse de K::N:: dans Q::n::Shixin Sun, Charles Payan. DM, 102(1):79-83, 1992. [doi]

1990

Some progress in the packing of equal circles in a squareMichel Mollard, Charles Payan. DM, 84(3):303-307, 1990. [doi]

1989

On Two Conjectures About Set-graceful GraphsMichel Mollard, Charles Payan. ejc, 10(2):185-187, 1989. [doi]

1986

Graphes Équilibrés et Arboricité RationnelleCharles Payan. ejc, 7(3):263-270, 1986. [doi]

1984

Generalized ::::n::::-tuple colorings of a graph: A counterexample to a conjecture of Brigham and DuttonAbdelkader Khelladi, Charles Payan. JCT, 37(3):283-289, 1984. [doi]

1983

Partition of odd regular graphs into bistarsFrançois Jaeger, Charles Payan, Mekkia Kouider. DM, 46(1):93-94, 1983. [doi]

Perfectness and dilworth numberCharles Payan. DM, 44(2):229-230, 1983. [doi]

1982

On digraphs without antidirected cyclesDouglas D. Grant, François Jaeger, Charles Payan. jgt, 6(2):133-138, 1982. [doi]

Domination-balanced graphsCharles Payan, Nguyen Huy Xuong. jgt, 6(1):23-32, 1982. [doi]

1980

A class of threshold and domishold graphs: equistable and equidominating graphsCharles Payan. DM, 29(1):47-52, 1980. [doi]

1979

A class of upper-embeddable graphsFrançois Jaeger, Charles Payan, Nguyen Huy Xuong. jgt, 3(4):387-391, 1979. [doi]

Upper embeddability and connectivity of graphsCharles Payan, Nguyen Huy Xuong. DM, 27(1):71-80, 1979. [doi]

1977

Sur quelques problèmes de couverture et de couplage en combinatoireCharles Payan. 1977. [doi]

1966

Contribution à la réalisation d'un prototype d'analyseur différentiel digitalCharles Payan. PhD thesis, Joseph Fourier University, Grenoble, France, 1966. [doi]

Sign in or sign up to see more results.

runs on WebDSL