Julien Bensmail

Clara Marcille

Discret. Math., 2026

Toughness properties of arbitrarily partitionable graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2026

The strong ( 2 , 2 ) -Conjecture for more classes of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2026

Graph Irregularity via Edge Deletions.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2026

2025

Irregularity Notions for Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., June, 2025

Highly irregular graph decompositions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2025

Adding direction constraints to the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Clara Marcille

Theor. Comput. Sci., 2025

Pushing Vertices to Make Graphs Irregular.

[BibT_eX]

[DOI]

Clara Marcille

Mano Orenga

Discret. Math. Theor. Comput. Sci., 2025

Maximising 1’s through proper labellings.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2025

On 1-2-3 Conjecture-like problems in 2-edge-coloured graphs.

[BibT_eX]

[DOI]

Discret. Math., 2025

Partitioning vertices and edges of graphs into connected subgraphs.

[BibT_eX]

[DOI]

Lyn Vayssieres

Appl. Math. Comput., 2025

2024

On Inducing Degenerate Sums Through 2-Labellings.

[BibT_eX]

[DOI]

Graphs Comb., April, 2024

On proper 2-labellings distinguishing by sums, multisets or products.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2024

A \sigma3 condition for arbitrarily partitionable graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2024

On a graph labelling conjecture involving coloured labels.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2024

Oriented total-coloring of oriented graphs.

[BibT_eX]

[DOI]

Discret. Math., 2024

A notion of vertex equitability for proper labellings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Interplays between variations of arbitrarily partitionable graphs under minimality constraints.

[BibT_eX]

[DOI]

Morgan Boivin

Appl. Math. Comput., 2024

An Improved Bound for Equitable Proper Labellings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023

On Finding the Best and Worst Orientations for the Metric Dimension.

[BibT_eX]

[DOI]

Algorithmica, October, 2023

Some properties of minimal arbitrarily partitionable graphs.

[BibT_eX]

[DOI]

Australas. J Comb., June, 2023

On the pushable chromatic number of various types of grids.

[BibT_eX]

[DOI]

Discret. Appl. Math., April, 2023

On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs.

[BibT_eX]

[DOI]

Dimitri Lajou

Theor. Comput. Sci., 2023

The Maker-Breaker Largest Connected Subgraph game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Deciding the Erdős-Pósa Property in 3-Connected Digraphs.

[BibT_eX]

[DOI]

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

The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

On a vertex-capturing game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Generalising the achromatic number to Zaslavsky's colourings of signed graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On the hardness of determining the irregularity strength of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On a List Variant of the Multiplicative 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Graphs Comb., 2022

More aspects of arbitrarily partitionable graphs.

[BibT_eX]

[DOI]

Binlong Li

Discuss. Math. Graph Theory, 2022

On {a, b}-edge-weightings of bipartite graphs with odd a, b.

[BibT_eX]

[DOI]

Kasper Szabo Lyngsie

Discuss. Math. Graph Theory, 2022

On the signed chromatic number of some classes of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Metric dimension: From graphs to oriented graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Going Wide with the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Further evidence towards the multiplicative 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

A Proof of the Multiplicative 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

On the role of 3s for the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

An Injective Version of the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Bi Li

Binlong Li

Graphs Comb., 2021

On Generalisations of the AVD Conjecture to Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

On BMRN*-colouring of planar digraphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

Pushable chromatic number of graphs with degree constraints.

[BibT_eX]

[DOI]

Discret. Math., 2021

On minimizing the maximum color for the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Further results on an equitable 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

The Largest Connected Subgraph Game.

[BibT_eX]

[DOI]

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

On the Role of 3's for the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Decomposing Degenerate Graphs into Locally Irregular Subgraphs.

[BibT_eX]

[DOI]

François Dross

Graphs Comb., 2020

From light edges to strong edge-colouring of 1-planar graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

1-2-3 Conjecture in digraphs: More results and directions.

[BibT_eX]

[DOI]

Kasper Szabo Lyngsie

Discret. Appl. Math., 2020

Enumeration of edge-critical underlying absolute planar cliques for signed graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

On Proper Labellings of Graphs with Minimum Label Sum.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Extending Drawings of Graphs to Arrangements of Pseudolines.

[BibT_eX]

[DOI]

Alan Arroyo

R. Bruce Richter

Proceedings of the 36th International Symposium on Computational Geometry, 2020

A contribution to distinguishing labellings of graphs.

[BibT_eX]

[DOI]

, 2020

2019

Backbone colouring and algorithms for TDMA scheduling.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Jakub Przybylo

Discret. Appl. Math., 2019

Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63].

[BibT_eX]

[DOI]

Soumen Nandi

Discret. Appl. Math., 2019

A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Edge weights and vertex colours: Minimizing sum count.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture.

[BibT_eX]

[DOI]

Comb., 2019

On the 2-edge-coloured chromatic number of grids.

[BibT_eX]

[DOI]

Australas. J Comb., 2019

2018

List coloring digraphs.

[BibT_eX]

[DOI]

Ararat Harutyunyan

Ngoc-Khang Le

J. Graph Theory, 2018

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

[BibT_eX]

[DOI]

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

On improving matchings in trees, via bounded-length augmentations.

[BibT_eX]

[DOI]

Valentin Garnero

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Erratum for "On oriented cliques with respect to push operation".

[BibT_eX]

[DOI]

Soumen Nandi

CoRR, 2018

Orienting edges to fight fire in graphs.

[BibT_eX]

[DOI]

Nick Brettell

Australas. J Comb., 2018

Sequential Metric Dimension.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2017

A proof of the Barát-Thomassen conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Analogues of Cliques for (m, n)-Colored Mixed Graphs.

[BibT_eX]

[DOI]

Christopher Duffy

Graphs Comb., 2017

Recovery of disrupted airline operations using k-Maximum Matching in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Decomposing graphs into a constant number of locally irregular subgraphs.

[BibT_eX]

[DOI]

Martin Merker

Carsten Thomassen

Eur. J. Comb., 2017

On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture.

[BibT_eX]

[DOI]

Mohammed Senhaji

Kasper Szabo Lyngsie

Discret. Math. Theor. Comput. Sci., 2017

On q-power cycles in cubic graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Structural properties of recursively partitionable graphs with connectivity 2.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

On oriented cliques with respect to push operation.

[BibT_eX]

[DOI]

Soumen Nandi

Discret. Appl. Math., 2017

On a directed variation of the 1-2-3 and 1-2 Conjectures.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Disjoint Cycles of Different Lengths in Graphs and Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs.

[BibT_eX]

[DOI]

Gabriel Renault

Graphs Comb., 2016

Edge-partitioning graphs into regular and locally irregular components.

[BibT_eX]

[DOI]

Brett Stevens

Discret. Math. Theor. Comput. Sci., 2016

The complexity of deciding whether a graph admits an orientation with fixed weak diameter.

[BibT_eX]

[DOI]

Romaric Duvignau

Sergey Kirgizov

Discret. Math. Theor. Comput. Sci., 2016

Strong edge-coloring of (3, Δ)-bipartite graphs.

[BibT_eX]

[DOI]

Aurélie Lagoutte

Petru Valicov

Discret. Math., 2016

On three polynomial kernels of sequences for arbitrarily partitionable graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

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

[BibT_eX]

[DOI]

Éric Sopena

J. Discrete Algorithms, 2015

On the complexity of partitioning a graph into a few connected subgraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Strong edge coloring sparse graphs.

[BibT_eX]

[DOI]

Marthe Bonamy

Electron. Notes Discret. Math., 2015

On decomposing regular graphs into locally irregular subgraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

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

[BibT_eX]

[DOI]

Éric Sopena

Discuss. Math. Graph Theory, 2015

2014

Partitioning powers of traceable or hamiltonian graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Partitioning Harary graphs into connected subgraphs containing prescribed vertices.

[BibT_eX]

[DOI]

Éric Sopena

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

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

[BibT_eX]

[DOI]

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

Strong edge-colouring of sparse planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

On cliques of signed and switchable signed graphs.

[BibT_eX]

[DOI]

Christopher Duffy