Olivier Baudon

Orcid: 0000-0002-7330-6479

According to our database1, Olivier Baudon authored at least 22 papers between 1990 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Interplays between variations of arbitrarily partitionable graphs under minimality constraints.
Appl. Math. Comput., 2024

2020
On a total version of 1-2-3 Conjecture.
Discuss. Math. Graph Theory, 2020

2019
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.
Discret. Math. Theor. Comput. Sci., 2019

Edge weights and vertex colours: Minimizing sum count.
Discret. Appl. Math., 2019

2018
On locally irregular decompositions and the 1-2 Conjecture in digraphs.
Discret. Math. Theor. Comput. Sci., 2018

Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture.
Discret. Appl. Math., 2018

2017
Structural properties of recursively partitionable graphs with connectivity 2.
Discuss. Math. Graph Theory, 2017

The neighbour-sum-distinguishing edge-colouring game.
Discret. Math., 2017

Equitable neighbour-sum-distinguishing edge and total colourings.
Discret. Appl. Math., 2017

2015
On the complexity of determining the irregular chromatic index of a graph.
J. Discrete Algorithms, 2015

On decomposing regular graphs into locally irregular subgraphs.
Eur. J. Comb., 2015

An oriented version of the 1-2-3 Conjecture.
Discuss. Math. Graph Theory, 2015

2014
Partitioning powers of traceable or hamiltonian graphs.
Theor. Comput. Sci., 2014

Partitioning Harary graphs into connected subgraphs containing prescribed vertices.
Discret. Math. Theor. Comput. Sci., 2014

On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.
Discret. Math. Theor. Comput. Sci., 2014

On the structure of arbitrarily partitionable graphs with given connectivity.
Discret. Appl. Math., 2014

2012
On minimal arbitrarily partitionable graphs.
Inf. Process. Lett., 2012

2005
2-1 routing requests in the hypercube.
Electron. Notes Discret. Math., 2005

2002
Decomposable trees: a polynomial algorithm fortripodes.
Discret. Appl. Math., 2002

2001
Routing permutations and 2-1 routing requests in the hypercube.
Discret. Appl. Math., 2001

1999
Routing Permutations in the Hypercube.
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).
PhD thesis, 1990


  Loading...