Olivier Baudon

According to our database, Olivier Baudon authored at least 23 papers between 1990 and 2025.

Collaborative distances:

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

2025

Partitioning vertices and edges of graphs into connected subgraphs.

Olivier Baudon, Julien Bensmail, Lyn Vayssieres

Appl. Math. Comput., 2025

2024

Interplays between variations of arbitrarily partitionable graphs under minimality constraints.

Olivier Baudon, Julien Bensmail, Morgan Boivin

Appl. Math. Comput., 2024

2020

On a total version of 1-2-3 Conjecture.

Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak

Discuss. Math. Graph Theory, 2020

2019

A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.

Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak

Discret. Math. Theor. Comput. Sci., 2019

Edge weights and vertex colours: Minimizing sum count.

Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena

Discret. Appl. Math., 2019

2018

On locally irregular decompositions and the 1-2 Conjecture in digraphs.

Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak

Discret. Math. Theor. Comput. Sci., 2018

Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture.

Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena

Discret. Appl. Math., 2018

2017

Structural properties of recursively partitionable graphs with connectivity 2.

Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak

Discuss. Math. Graph Theory, 2017

The neighbour-sum-distinguishing edge-colouring game.

Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak

Discret. Math., 2017

Equitable neighbour-sum-distinguishing edge and total colourings.

Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak

Discret. Appl. Math., 2017

2015

On the complexity of determining the irregular chromatic index of a graph.

Olivier Baudon, Julien Bensmail, Éric Sopena

J. Discrete Algorithms, 2015

On decomposing regular graphs into locally irregular subgraphs.

Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak

Eur. J. Comb., 2015

An oriented version of the 1-2-3 Conjecture.

Olivier Baudon, Julien Bensmail, Éric Sopena

Discuss. Math. Graph Theory, 2015

2014

Partitioning powers of traceable or hamiltonian graphs.

Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak

Theor. Comput. Sci., 2014

Partitioning Harary graphs into connected subgraphs containing prescribed vertices.

Olivier Baudon, Julien Bensmail, Éric Sopena

Discret. Math. Theor. Comput. Sci., 2014

On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.

Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak

Discret. Math. Theor. Comput. Sci., 2014

On the structure of arbitrarily partitionable graphs with given connectivity.

Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak

Discret. Appl. Math., 2014

2012

On minimal arbitrarily partitionable graphs.

Olivier Baudon, Jakub Przybylo, Mariusz Wozniak

Inf. Process. Lett., 2012

2005

2-1 routing requests in the hypercube.

Olivier Baudon

Electron. Notes Discret. Math., 2005

2002

Decomposable trees: a polynomial algorithm fortripodes.

Dominique Barth, Olivier Baudon, Joël Puech

Discret. Appl. Math., 2002

2001

Routing permutations and 2-1 routing requests in the hypercube.

Olivier Baudon, Guillaume Fertin, Ivan Havel

Discret. Appl. Math., 2001

1999

Routing Permutations in the Hypercube.

Olivier Baudon, Guillaume Fertin, Ivan Havel

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1990

Cabri-graphes : un cahier de brouillon interactif pour la théorie des graphes. (Cabri-graphes, an interactive sketchpad for graph theory).

Olivier Baudon

PhD thesis, 1990