-
1
On BMRN*-colouring of planar digraphs
Published 2021-02-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article -
2
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture
Published 2017-08-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article -
3
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph
Published 2014-04-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article -
4
Edge-partitioning graphs into regular and locally irregular components
Published 2016-02-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article -
5
The complexity of deciding whether a graph admits an orientation with fixed weak diameter
Published 2016-02-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article -
6
Backbone colouring and algorithms for TDMA scheduling
Published 2019-07-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article -
7
From light edges to strong edge-colouring of 1-planar graphs
Published 2020-01-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article -
8
On locally irregular decompositions and the 1-2 Conjecture in digraphs
Published 2018-10-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article -
9
Partitioning Harary graphs into connected subgraphs containing prescribed vertices
Published 2014-12-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article -
10
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions
Published 2019-04-01“…Discrete Mathematics & Theoretical Computer Science…”
Get full text
Article