Alain Faisant

According to our database, Alain Faisant authored at least 5 papers between 2006 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs.

Alain Bretto, Alain Faisant, François Hennecart

Discret. Math., 2020

2011

Cayley graphs and G-graphs: Some applications.

Alain Bretto, Alain Faisant

J. Symb. Comput., 2011

New graphs related to (p, 6) and (p, 8)-cages.

Alain Bretto, Alain Faisant, Luc Gillibert

Comput. Math. Appl., 2011

2007

G-graphs: A new representation of groups.

Alain Bretto, Alain Faisant, Luc Gillibert

J. Symb. Comput., 2007

2006

Compatible topologies on graphs: An application to graph isomorphism problem complexity.

Alain Bretto, Alain Faisant, Thierry Vallée

Theor. Comput. Sci., 2006