Julien Bensmail

From MaRDI portal
Person:244929

Available identifiers

zbMath Open bensmail.julienMaRDI QIDQ244929

List of research outcomes

PublicationDate of PublicationType
Deciding the Erdős-Pósa Property in 3-Connected Digraphs2024-05-03Paper
On inducing degenerate sums through 2-labellings2024-02-15Paper
A notion of vertex equitability for proper labellings2024-02-14Paper
https://portal.mardi4nfdi.de/entity/Q60599562023-11-02Paper
A proof of the multiplicative 1-2-3 conjecture2023-10-04Paper
https://portal.mardi4nfdi.de/entity/Q61349402023-08-23Paper
The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures2023-08-17Paper
A proof of the multiplicative 1-2-3 conjecture2023-05-08Paper
On the role of 3's for the 1-2-3 conjecture2023-03-22Paper
On the pushable chromatic number of various types of grids2023-02-24Paper
The maker-breaker largest connected subgraph game2023-01-05Paper
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs2022-11-17Paper
Metric dimension: from graphs to oriented graphs2022-11-02Paper
On the hardness of determining the irregularity strength of graphs2022-10-24Paper
On Proper Labellings of Graphs with Minimum Label Sum2022-10-13Paper
Going wide with the 1-2-3 conjecture2022-08-24Paper
The largest connected subgraph game2022-08-18Paper
More aspects of arbitrarily partitionable graphs2022-07-26Paper
On a vertex-capturing game2022-06-13Paper
Generalising the achromatic number to Zaslavsky's colourings of signed graphs2022-06-13Paper
The largest connected subgraph game2022-06-08Paper
On a list variant of the multiplicative 1-2-3 conjecture2022-05-09Paper
Metric dimension: from graphs to oriented graphs2022-04-27Paper
On proper labellings of graphs with minimum label sum2022-03-22Paper
On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)2022-01-03Paper
Further evidence towards the multiplicative 1-2-3 conjecture2021-12-07Paper
On the signed chromatic number of some classes of graphs2021-11-23Paper
On the role of 3s for the 1--2--3 conjecture2021-10-21Paper
Generalising the achromatic number to Zaslavsky's colourings of signed graphs2021-09-28Paper
On BMRN*-colouring of planar digraphs2021-05-03Paper
Further results on an equitable 1-2-3 conjecture2021-04-29Paper
Decomposing degenerate graphs into locally irregular subgraphs2021-03-17Paper
An injective version of the 1-2-3 conjecture2021-03-17Paper
On generalisations of the AVD conjecture to digraphs2021-03-17Paper
Extending Drawings of Graphs to Arrangements of Pseudolines2021-03-17Paper
Pushable chromatic number of graphs with degree constraints2021-01-21Paper
On minimizing the maximum color for the 1-2-3 conjecture2020-12-29Paper
From light edges to strong edge-colouring of 1-planar graphs2020-10-28Paper
Sequential metric dimension2020-10-12Paper
https://portal.mardi4nfdi.de/entity/Q33006932020-07-29Paper
1-2-3 Conjecture in digraphs: more results and directions2020-07-07Paper
https://portal.mardi4nfdi.de/entity/Q52069362019-12-19Paper
Edge weights and vertex colours: minimizing sum count2019-11-06Paper
Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture2019-09-19Paper
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture2019-09-04Paper
https://portal.mardi4nfdi.de/entity/Q52268462019-08-01Paper
https://portal.mardi4nfdi.de/entity/Q53772212019-05-23Paper
Erratum to: ``On oriented cliques with respect to push operation2019-03-22Paper
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs2019-03-11Paper
https://portal.mardi4nfdi.de/entity/Q46160902019-01-30Paper
Sequential metric dimension2019-01-15Paper
https://portal.mardi4nfdi.de/entity/Q45602602018-12-10Paper
On locally irregular decompositions of subcubic graphs2018-12-10Paper
Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture2018-12-03Paper
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture2018-11-30Paper
A proof of the Barát-Thomassen conjecture2018-10-29Paper
On improving matchings in trees, via bounded-length augmentations2018-10-26Paper
List coloring digraphs2018-04-27Paper
Recovery of disrupted airline operations using \(k\)-maximum matching in graphs2018-04-09Paper
Disjoint cycles of different lengths in graphs and digraphs2017-12-12Paper
On oriented cliques with respect to push operation2017-10-17Paper
Analogues of cliques for \((m,n)\)-colored mixed graphs2017-10-11Paper
On a directed variation of the 1-2-3 and 1-2 conjectures2017-03-15Paper
On \(q\)-power cycles in cubic graphs2017-01-23Paper
Structural properties of recursively partitionable graphs with connectivity 22017-01-23Paper
Decomposing oriented graphs into six locally irregular oriented graphs2016-11-29Paper
Decomposing graphs into a constant number of locally irregular subgraphs2016-11-07Paper
Strong edge coloring sparse graphs2016-10-14Paper
https://portal.mardi4nfdi.de/entity/Q28085342016-05-24Paper
https://portal.mardi4nfdi.de/entity/Q28085352016-05-24Paper
On three polynomial kernels of sequences for arbitrarily partitionable graphs2016-02-12Paper
Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs2015-10-08Paper
On the complexity of partitioning a graph into a few connected subgraphs2015-07-01Paper
On decomposing regular graphs into locally irregular subgraphs2015-06-18Paper
An oriented version of the 1-2-3 conjecture2015-03-04Paper
On the complexity of determining the irregular chromatic index of a graph2015-02-13Paper
https://portal.mardi4nfdi.de/entity/Q51731592015-02-09Paper
Strong edge-colouring of sparse planar graphs2014-12-03Paper
Analogous to cliques for (m,n)-colored mixed graphs2014-11-26Paper
https://portal.mardi4nfdi.de/entity/Q54200362014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54139122014-05-02Paper
Partitioning powers of traceable or Hamiltonian graphs2014-01-13Paper
On the longest path in a recursively partitionable graph2013-11-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Julien Bensmail