Publications of Julien Bensmail
BACK TO COATI PUBLICATION INDEX
Publications of Julien Bensmail
-
Julien Bensmail.
A contribution to distinguishing labellings of graphs.
Habilitation à diriger des recherches,
Université côte d'azur,
December 2020.
[WWW
] [PDF
]
Keywords:
distinguishing labellings,
1-2-3 Conjecture,
locally irregular decompositions,
graph decompositions,
graph colourings,
pondérations distinguantes.
[bibtex-entry]
-
Julien Bensmail,
Sandip Das,
Soumen Nandi,
Théo Pierron,
Sagnik Sen,
and Eric Sopena.
On the signed chromatic number of some classes of graphs.
Discrete Mathematics,
345:112664,
2022.
[WWW
] [PDF
]
Keywords:
Kn-minor-free graph,
bounded-degree graph,
triangle-free planar graph,
homomorphism of signed graphs,
planar graph,
signed chromatic number.
[bibtex-entry]
-
Julien Bensmail,
Hervé Hocquard,
Dimitri Lajou,
and Eric Sopena.
Further Evidence Towards the Multiplicative 1-2-3 Conjecture.
Discrete Applied Mathematics,
307:135-144,
2022.
[WWW
] [PDF
]
Keywords:
1-2-3 Conjecture,
multiset version,
product version,
4-chromatic graphs.
[bibtex-entry]
-
Julien Bensmail,
Fionn Mc Inerney,
and Kasper Lyngsie.
On a,b-edge-weightings of bipartite graphs with odd a,b.
Discussiones Mathematicae Graph Theory,
42(1):159-185,
2022.
[WWW
] [PDF
] [bibtex-entry]
-
Alan Arroyo,
Julien Bensmail,
and Bruce R. Richter.
Extending Drawings of Graphs to Arrangements of Pseudolines.
Journal of Computational Geometry,
12(2):3-24,
2021.
[WWW
] [PDF
]
Keywords:
graphs,
graph drawings,
geometric graph drawings,
arrangements of pseudolines,
crossing numbers,
stretchability.
[bibtex-entry]
-
Julien Bensmail,
Sandip Das,
Soumen Nandi,
Soumyajit Paul,
Théo Pierron,
Sagnik Sen,
and Eric Sopena.
Pushable chromatic number of graphs with degree constraints.
Discrete Mathematics,
344(1):112151,
2021.
[WWW
] [PDF
]
Keywords:
graph homomorphism,
maximum degree,
subcubicgraph,
oriented coloring,
push operation.
[bibtex-entry]
-
Julien Bensmail and Foivos Fioravantes.
On BMRN*-colouring of planar digraphs.
Discrete Mathematics and Theoretical Computer Science,
23(1):#4,
February 2021.
[WWW
] [PDF
]
Keywords:
BMRN*-colouring,
planar digraphs,
TDMA scheduling.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
and Fionn Mc Inerney.
On the Role of 3s for the 1-2-3 Conjecture.
Theoretical Computer Science,
892:238-257,
2021.
[WWW
] [PDF
]
Keywords:
Proper labellings,
3-chromatic graphs,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
Further Results on an Equitable 1-2-3 Conjecture.
Discrete Applied Mathematics,
297:1-20,
2021.
[WWW
] [PDF
]
Keywords:
Proper labellings,
Equitable labellings,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
and Nicolas Nisse.
On Proper Labellings of Graphs with Minimum Label Sum.
Algorithmica,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Bi Li,
Binlong Li,
and Nicolas Nisse.
On Minimizing the Maximum Color for the 1-2-3 Conjecture.
Discrete Applied Mathematics,
289:32-51,
2021.
[WWW
] [PDF
]
Keywords:
proper vertex-colorings,
edge labelings,
1-2-3 Conjecture,
small vertex colors.
[bibtex-entry]
-
Julien Bensmail,
Bi Li,
and Binlong Li.
An injective version of the 1-2-3 Conjecture.
Graphs and Combinatorics,
37:281-311,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail and Fionn Mc Inerney.
On Generalisations of the AVD Conjecture to Digraphs.
Graphs and Combinatorics,
37:545-558,
2021.
[WWW
] [PDF
]
Keywords:
Digraphs,
AVD Conjecture,
Proper edge-colourings,
proper edge-colourings,
digraphs.
[bibtex-entry]
-
Julien Bensmail.
On a graph labelling conjecture involving coloured labels.
Discussiones Mathematicae Graph Theory,
2021.
[WWW
] [PDF
]
Keywords:
Proper labellings,
Coloured labels,
Weak (2,
2)-Conjecture,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail,
François Dross,
Hervé Hocquard,
and Eric Sopena.
From light edges to strong edge-colouring of 1-planar graphs.
Discrete Mathematics and Theoretical Computer Science,
vol. 22 no. 1(2),
January 2020.
[WWW
] [PDF
]
Keywords:
1-planar graphs,
Light edges,
Strong edge-colouring,
Strong chromatic index.
[bibtex-entry]
-
Julien Bensmail,
François Dross,
and Nicolas Nisse.
Decomposing degenerate graphs into locally irregular subgraphs.
Graphs and Combinatorics,
36(6):1869--1889,
2020.
[WWW
] [PDF
]
Keywords:
planar graphs,
k-trees,
locally irregular decompositions,
degenerate graphs,
cacti.
[bibtex-entry]
-
Julien Bensmail,
Bi Li,
and Binlong Li.
An injective version of the 1-2-3 Conjecture.
Graphs and Combinatorics,
2020.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail and Binlong Li.
More Aspects of Arbitrarily Partitionable Graphs.
Discussiones Mathematicae Graph Theory,
2020.
[WWW
] [PDF
]
Keywords:
arbitrarily partitionable graphs,
partition into connected subgraphs,
Hamiltonicity.
[bibtex-entry]
-
Julien Bensmail and Kasper Lyngsie.
1-2-3 Conjecture in Digraphs: More Results and Directions.
Discrete Applied Mathematics,
284:124-137,
2020.
[WWW
] [PDF
]
Keywords:
Choosability,
Complexity,
1-2-3 Conjecture,
Directed variants,
Bounds.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
Algorithmica,
82(10):2867-2901,
2020.
[WWW
] [PDF
]
Keywords:
Complexity,
Metric dimension,
Games in graphs.
[bibtex-entry]
-
Julien Bensmail,
Fionn Mc Inerney,
and Nicolas Nisse.
Metric Dimension: from Graphs to Oriented Graphs.
Discrete Applied Mathematics,
2020.
[WWW
] [PDF
]
Keywords:
Strongly-connected orientations,
Metric dimension,
Resolving sets.
[bibtex-entry]
-
Julien Bensmail and Fionn Mc Inerney.
On Generalisations of the AVD Conjecture to Digraphs.
Graphs and Combinatorics,
2020.
[WWW
] [PDF
]
Keywords:
Digraphs,
AVD Conjecture,
Proper edge-colourings,
proper edge-colourings,
digraphs.
[bibtex-entry]
-
Julien Bensmail,
Soumen Nandi,
Mithun Roy,
and Sagnik Sen.
Classification of edge-critical underlying absolute planar cliques for signed graphs.
The Australasian Journal of Combinatorics,
77(1):117-135,
June 2020.
[WWW
] [PDF
]
Keywords:
planar graphs,
absolute cliques,
signed graphs,
graph homomorphisms.
[bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Tom Davot,
Hervé Hocquard,
Jakub Przybylo,
Mohammed Senhaji,
Eric Sopena,
and Mariusz Wozniak.
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.
Discrete Mathematics and Theoretical Computer Science,
21(1),
April 2019.
[WWW
] [PDF
]
Keywords:
Coloured weighted degrees,
1-2-3 Conjecture,
Locally irregular decompositions.
[bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Hervé Hocquard,
Mohammed Senhaji,
and Eric Sopena.
Edge Weights and Vertex Colours: Minimizing Sum Count.
Discrete Applied Mathematics,
270:13-24,
November 2019.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Thibaut Blanc,
Nathann Cohen,
Frédéric Havet,
and Leonardo Rocha.
Backbone colouring and algorithms for TDMA scheduling.
Discrete Mathematics and Theoretical Computer Science,
Vol. 21 no. 3(3):#24,
July 2019.
[WWW
] [PDF
]
Keywords:
Wireless networks,
TDMA scheduling,
Backbone colouring,
Algorithmic complexity.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Tien-Nam Le,
and Stéphan Thomassé.
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture.
Combinatorica,
39(2):239-263,
April 2019.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Fionn Mc Inerney,
and Kasper Lyngsie.
On a,b-edge-weightings of bipartite graphs with odd a,b.
Discussiones Mathematicae Graph Theory,
2019.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail and Jakub PrzybyÆo.
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture.
Discrete Applied Mathematics,
September 2019.
[WWW
] [PDF
]
Keywords:
graph decomposition,
1-2-3 Conjecture,
locally irregular graph.
[bibtex-entry]
-
Julien Bensmail.
A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs.
Discrete Applied Mathematics,
257:31-39,
February 2019.
[WWW
] [PDF
]
Keywords:
1-2-3 Conjecture,
Four weights,
5-regular graphs.
[bibtex-entry]
-
Julien Bensmail.
On the 2-edge-coloured chromatic number of grids.
The Australasian Journal of Combinatorics,
75(3):365-384,
2019.
[WWW
] [PDF
]
Keywords:
grids,
oriented chromatic number,
2-edge-coloured chromatic number.
[bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Hervé Hocquard,
Mohammed Senhaji,
and Eric Sopena.
On locally irregular decompositions of subcubic graphs.
Opuscula Mathematica,
38(6):795-817,
July 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Jakub Przybylo,
and Mariusz Wozniak.
On locally irregular decompositions and the 1-2 Conjecture in digraphs.
Discrete Mathematics and Theoretical Computer Science,
vol. 20 no. 2,
October 2018.
[WWW
] [PDF
]
Keywords:
1-2 Conjecture,
locally irregular decompositions,
digraphs.
[bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Mohammed Senhaji,
and Eric Sopena.
Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 Conjecture.
Discrete Applied Mathematics,
251(83-92),
November 2018.
[WWW
] [PDF
]
Keywords:
Bipartite graphs,
1-2-3 Conjecture,
Difference-2 distinction.
[bibtex-entry]
-
Julien Bensmail and Nick Brettell.
Orienting edges to fight fire in graphs.
The Australasian Journal of Combinatorics,
71(1):12-42,
March 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Valentin Garnero,
and Nicolas Nisse.
On improving matchings in trees, via bounded-length augmentations.
Discrete Applied Mathematics,
250(11):110-129,
2018.
[WWW
] [PDF
]
Keywords:
trees,
maximum matchings,
bounded-length augmentations.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
and Ngoc Khang Le.
List coloring digraphs.
Journal of Graph Theory,
87(4):492-508,
April 2018.
[WWW
] [PDF
]
Keywords:
dichromatic number,
list dichromatic number,
list coloring,
digraphs.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Tien-Nam Le,
and Stéphan Thomassé.
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture.
Combinatorica,
2018.
[WWW
] [PDF
] [bibtex-entry]
-
Emma Barme,
Julien Bensmail,
Jakub Przybylo,
and Mariusz Wozniak.
On a directed variation of the 1-2-3 and 1-2 Conjectures.
Discrete Applied Mathematics,
217(2):123-131,
January 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Florent Foucaud,
and Monika Pilsniak.
Structural properties of recursively partitionable graphs with connectivity 2.
Discussiones Mathematicae Graph Theory,
37:89-115,
February 2017.
[WWW
] [PDF
]
Keywords:
balloon graph,
graph with connectivity 2,
online arbitrarily partitionable graph,
recursively arbitrarily partitionable graph,
balloon,
structural properties.
[bibtex-entry]
-
Julien Bensmail,
Christopher Duffy,
and Sagnik Sen.
Analogues of Cliques for (m,n)-colored Mixed Graphs.
Graphs and Combinatorics,
33(4):735--750,
May 2017.
[WWW
] [PDF
]
Keywords:
graph homomorphisms,
planar graphs,
colored mixed graphs,
signed graphs,
graph homomorphism,
chromatic number,
clique number.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Ngoc Khang Le,
Binlong Li,
and Nicolas Lichiardopol.
Disjoint cycles of different lengths in graphs and digraphs.
The Electronic Journal of Combinatorics,
24(4),
December 2017.
[WWW
] [PDF
]
Keywords:
minimum degree,
vertex-disjoint cycles,
different lengths.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Tien-Nam Le,
Martin Merker,
and Stéphan Thomassé.
A Proof of the Barát--Thomassen Conjecture.
Journal of Combinatorial Theory, Series B,
124:39 - 55,
May 2017.
[WWW
] [PDF
]
Keywords:
large edge-connectivity,
Barát-Thomassen Conjecture,
tree-decomposition.
[bibtex-entry]
-
Julien Bensmail.
On q-power cycles in cubic graphs.
Discussiones Mathematicae Graph Theory,
37(1):211 - 220,
2017.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Martin Merker,
and Carsten Thomassen.
Decomposing graphs into a constant number of locally irregular subgraphs.
European Journal of Combinatorics,
60:124 - 134,
February 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Soumen Nandi,
and Sagnik Sen.
On oriented cliques with respect to push operation.
Discrete Applied Mathematics,
232:50 - 63,
December 2017.
[WWW
] [PDF
]
Keywords:
oriented graphs,
oriented cliques,
push operation,
planar graphs.
[bibtex-entry]
-
Julien Bensmail,
Mohammed Senhaji,
and Kasper Szabo Lyngsie.
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture.
Discrete Mathematics and Theoretical Computer Science,
19(1),
August 2017.
[WWW
] [PDF
]
Keywords:
equitable edge-weightings,
1-2-3 Conjecture,
Antimagic Labelling Conjecture.
[bibtex-entry]
-
Julien Bensmail,
Hervé Hocquard,
Dimitri Lajou,
and Eric Sopena.
A proof of the Multiplicative 1-2-3 Conjecture.
In CALDAM 2022 - 8th Annual International Conference on Algorithms and Discrete Applied Mathematics,
Puducherry, India,
2022.
[WWW
] [PDF
]
Keywords:
1-2-3 Conjecture,
product version,
labels 1-2-3.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
Connexions ! Le jeu du plus grand sous-graphe connexe.
In ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
La Rochelle, France,
September 2021.
[WWW
] [PDF
]
Keywords:
Games on graphs,
Scoring games,
Connection games,
PSPACE-complete,
Jeux à deux joueurs dans les graphes,
Jeux de connexion,
Jeux à score.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
and Fionn Mc Inerney.
On the Role of 3's for the 1-2-3 Conjecture.
In CIAC 2021 - 12th International Conference on Algorithms and Complexity,
volume 12701 of Lecture Notes in Computer Science,
Larnaca, Cyprus,
pages 103-115,
May 2021.
Springer.
[WWW
] [PDF
]
Keywords:
3-chromatic graphs,
Proper labellings,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
The Largest Connected Subgraph Game.
In WG 2021 - The 47th International Workshop on Graph-Theoretic Concepts in Computer Science,
volume 12911 of Lecture Notes in Computer Science,
Warsaw, Poland,
pages 296-307,
June 2021.
Springer.
[WWW
] [PDF
]
Keywords:
Games on graphs,
Scoring games,
Connection games,
PSPACE-complete.
[bibtex-entry]
-
Alan Arroyo,
Julien Bensmail,
and R. Bruce Richter.
Extending Drawings of Graphs to Arrangements of Pseudolines.
In SoCG 2020 - 36th International Symposium on Computational Geometry,
Zürich, Switzerland,
June 2020.
[WWW
] [PDF
]
Keywords:
graph drawings,
geometric graph drawings,
arrangements of pseudolines,
crossing numbers,
stretchability,
graphs.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
and Nicolas Nisse.
On Proper Labellings of Graphs with Minimum Label Sum.
In IWOCA 2020 - 31st International Workshop on Combinatorial Algorithms,
Bordeaux, France,
June 2020.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Fionn Mc Inerney,
and Nicolas Nisse.
Dimension Métrique des Graphes Orientés.
In AlgoTel 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Saint Laurent de la Cabrerisse, France,
June 2019.
[WWW
] [PDF
]
Keywords:
Graphes,
Dimension Métrique,
Ensembles Resolvants,
Orientations fortement connexes.
[bibtex-entry]
-
Julien Bensmail,
Fionn Mc Inerney,
and Nicolas Nisse.
Metric Dimension: from Graphs to Oriented Graphs.
In LAGOS 2019 - 10th Latin & American Algorithms, Graphs and Optimization Symposium,
volume 346 of Electronic Notes in Theoretical Computer Science,
Belo Horizonte, Brazil,
pages 111-123,
June 2019.
[WWW
] [PDF
]
Keywords:
Strongly-connected orientations,
Resolving sets,
Metric dimension.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
In 16th Workshop on Approximation and Online Algorithms (WAOA 2018),
Helsinki, Finland,
August 2018.
[WWW
] [PDF
]
Keywords:
metric dimension,
Games in graphs,
complexity.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Localiser une cible dans un graphe.
In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Roscoff, France,
May 2018.
[WWW
] [PDF
]
Keywords:
Mots-clefs : Graphes,
Dimension Métrique,
Dimension Centro¨idaleCentro¨idale,
Jeux dans les graphes.
[bibtex-entry]
-
Julien Bensmail,
Valentin Garnero,
Nicolas Nisse,
Alexandre Salch,
and Valentin Weber.
Recovery of disrupted airline operations using k-Maximum Matching in graphs.
In IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS),
volume 62 of Electronic Notes in Discrete Mathematics (IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)),
Marseille, France,
pages 3-8,
September 2017.
[WWW
] [PDF
]
Keywords:
Graph,
Matching,
Augmenting paths,
Complexity,
Trees.
[bibtex-entry]
-
Julien Bensmail,
Tapas Das,
Dimitri Lajou,
Soumen Nandi,
and Sagnik Sen.
On the pushable chromatic number of various types of grids.
Research Report,
Université Côte d'Azur ; Université de Bordeaux,
2022.
[WWW
] [PDF
]
Keywords:
oriented graph,
oriented colouring,
pushable chromatic number,
grid.
[bibtex-entry]
-
Julien Bensmail and Foivos Fioravantes.
On proper 2-labellings distinguishing by sums, multisets or products.
Research Report,
Université Côte d'Azur,
2022.
[WWW
] [PDF
]
Keywords:
proper labelling,
sum of labels,
multiset of labels,
product of labels.
[bibtex-entry]
-
Julien Bensmail,
François Dross,
Nacim Oijid,
and Éric Sopena.
Generalising the achromatic number to Zaslavsky's colourings of signed graphs.
Research Report,
Université côte d'azur ; Université de Bordeaux ; Université lyon 1,
2021.
[WWW
] [PDF
]
Keywords:
chromatic number,
achromatic number,
complete colouring,
Zaslavsky's colouring,
signed graph.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
Nicolas Nisse,
and Nacim Oijid.
The Maker-Breaker Largest Connected Subgraph Game.
Research Report,
Université Côte dâAzur, CNRS, Inria, I3S, Biot, France,
2021.
[WWW
] [PDF
]
Keywords:
Maker-Breaker games,
Largest connected subgraph game,
Connection games,
PSPACE-complete.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
The Largest Connected Subgraph Game.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; CISPA Helmholtz Center for Information Security, Saarbrücken, Germany,
2021.
[WWW
] [PDF
]
Keywords:
Games on graphs,
Scoring games,
Connection games,
PSPACE-complete,
GI-hard.
[bibtex-entry]
-
Julien Bensmail,
Hervé Hocquard,
Dimitri Lajou,
and Éric Sopena.
A proof of the Multiplicative 1-2-3 Conjecture.
Research Report,
Université côte d'azur ; Université de bordeaux,
2021.
[WWW
] [PDF
]
Keywords:
1-2-3 Conjecture,
product version,
labels 1-2-3.
[bibtex-entry]
-
Julien Bensmail,
Hervé Hocquard,
Dimitri Lajou,
and Eric Sopena.
On a List Variant of the Multiplicative 1-2-3 Conjecture.
Research Report,
Université de bordeaux ; Université côte d'azur,
2021.
[WWW
] [PDF
]
Keywords:
proper labelling,
1-2-3 Conjecture,
product,
list.
[bibtex-entry]
-
Julien Bensmail,
Hervé Hocquard,
and Pierre-Marie Marcille.
Going Wide with the 1-2-3 Conjecture.
Research Report,
Université Côte d'Azur ; Université de Bordeaux ; ENS Lyon,
2021.
[WWW
] [PDF
]
Keywords:
Distinguishing labelling,
1-2-3 Conjecture,
fixed radius.
[bibtex-entry]
-
Julien Bensmail and Fionn Mc Inerney.
The Vertex-Capturing Game.
Research Report,
Université Côte d'Azur ; CISPA Helmholtz Center for Information Security,
2021.
[WWW
] [PDF
]
Keywords:
scoring game,
combinatorial game,
2-player game,
graph.
[bibtex-entry]
-
Julio Araujo,
Julien Bensmail,
Victor Campos,
Frédéric Havet,
Ana Karolinna Maia De Oliveira,
Nicolas Nisse,
and Ana Silva.
On finding the best and worst orientations for the metric dimension.
Research Report,
Inria,
2020.
[WWW
] [PDF
]
Keywords:
Undirected graphs,
Resolving sets,
Metric dimension,
Digraphs.
[bibtex-entry]
-
Julien Bensmail,
Sandip Das,
Soumen Nandi,
Théo Pierron,
Sagnik Sen,
and Eric Sopena.
On the signed chromatic number of some classes of graphs.
Research Report,
Université Côte D'Azur ; Université de Bordeaux ; Université Lyon 1,
2020.
[WWW
] [PDF
]
Keywords:
Kn-minor-free graph,
bounded-degree graph,
triangle-free planar graph,
homomorphism of signed graphs,
planar graph,
signed chromatic number.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
and Fionn Mc Inerney.
On the Role of 3's for the 1-2-3 Conjecture.
Research Report,
Université côte d'azur ; Aix-Marseille Universite,
2020.
[WWW
] [PDF
]
Keywords:
Proper labellings,
3-chromatic graphs,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail and Foivos Fioravantes.
On BMRN*-colouring of planar digraphs.
Research Report,
Université Côte d'Azur, CNRS, I3S, France,
2020.
[WWW
] [PDF
]
Keywords:
BMRN*-colouring,
planar digraphs,
TDMA scheduling.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
Further Results on an Equitable 1-2-3 Conjecture.
Research Report,
Université Côte d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis ; Aix-Marseille Université (AMU),
April 2020.
[WWW
] [PDF
]
Keywords:
Proper labellings,
Equitable labellings,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
and Nicolas Nisse.
On Proper Labellings of Graphs with Minimum Label Sum.
Research Report,
Inria - Sophia antipolis,
2020.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Hervé Hocquard,
Dimitri Lajou,
and Eric Sopena.
Further Evidence Towards the Multiplicative 1-2-3 Conjecture.
Research Report,
Université côte d'azur ; Université de bordeaux,
April 2020.
[WWW
] [PDF
]
Keywords:
1-2-3 Conjecture,
multiset version,
product version,
4-chromatic graphs.
[bibtex-entry]
-
Julien Bensmail.
On a graph labelling conjecture involving coloured labels.
Research Report,
Université côte d'azur,
April 2020.
[WWW
] [PDF
]
Keywords:
Proper labellings,
Coloured labels,
Weak (2,
2)-Conjecture,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
Research Report,
Inria,
2018.
[WWW
] [PDF
]
Keywords:
complexity,
Metric dimension,
Games in graphs.
[bibtex-entry]
-
Julien Bensmail,
Fionn Mc Inerney,
and Nicolas Nisse.
Metric Dimension: from Graphs to Oriented Graphs.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France,
November 2018.
[WWW
] [PDF
]
Keywords:
Strongly-connected orientations,
Metric dimension,
Resolving sets.
[bibtex-entry]
-
Julien Bensmail,
Valentin Garnero,
and Nicolas Nisse.
On improving matchings in trees, via bounded-length augmentations.
Research Report,
Université Côte d'Azur,
July 2017.
[WWW
] [PDF
]
Keywords:
trees,
bounded-length augmentations,
maximum matchings.
[bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Hervé Hocquard,
Mohammed Senhaji,
and Eric Sopena.
On locally irregular decompositions of subcubic graphs.
Research Report,
Université de bordeaux ; Université de Nice - Sophia Antipolis,
2016.
[WWW
] [PDF
] [bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Jakub Przybylo,
and Mariusz Wozniak.
On locally irregular decompositions and the 1-2 Conjecture in digraphs.
Research Report,
Inria, CNRS, Université de Bordeaux, AGH University,
September 2016.
[WWW
] [PDF
] [bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Hervé Hocquard,
Mohammed Senhaji,
and Eric Sopena.
Edge Weights and Vertex Colours: Minimizing Sum Count.
Note: Working paper or preprint,
July 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail and Binlong Li.
More Aspects of Arbitrarily Partitionable Graphs.
Note: Working paper or preprint,
November 2018.
[WWW
] [PDF
]
Keywords:
arbitrarily partitionable graphs,
partition into connected subgraphs,
Hamiltonicity.
[bibtex-entry]
-
Julien Bensmail,
Soumen Nandi,
Mithun Roy,
and Sagnik Sen.
On homomorphisms of planar signed graphs and absolute cliques.
Note: Working paper or preprint,
November 2018.
[WWW
] [PDF
]
Keywords:
absolute signed cliques,
planar graphs,
graph homomorphisms,
signed graphs.
[bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:43 2022
