2024
On the broadcast independence number of circulant graphs.
Discret. Math. Algorithms Appl., July, 2024
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs.
SIAM J. Discret. Math., March, 2024
Strong incidence colouring of graphs.
Discuss. Math. Graph Theory, 2024
On the broadcast independence number of locally uniform 2-lobsters.
Discuss. Math. Graph Theory, 2024
On the oriented achromatic number of graphs.
Discret. Appl. Math., 2024
Broadcast independence number of oriented circulant graphs.
CoRR, 2024
2023
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable.
J. Graph Theory, September, 2023
A Proof of the Multiplicative 1-2-3 Conjecture.
Comb., February, 2023
2022
A note on the neighbour-distinguishing index of digraphs.
Ars Math. Contemp., October, 2022
Generalising the achromatic number to Zaslavsky's colourings of signed graphs.
Theor. Comput. Sci., 2022
On a List Variant of the Multiplicative 1-2-3 Conjecture.
Graphs Comb., 2022
On the signed chromatic number of some classes of graphs.
Discret. Math., 2022
Further evidence towards the multiplicative 1-2-3 Conjecture.
Discret. Appl. Math., 2022
Homomorphisms of (n, m)-graphs with respect to generalised switch.
CoRR, 2022
2021
Homomorphisms of signed graphs: An update.
Eur. J. Comb., 2021
Pushable chromatic number of graphs with degree constraints.
Discret. Math., 2021
Exact square coloring of subcubic planar graphs.
Discret. Appl. Math., 2021
(α, β)-Modules in Graphs.
CoRR, 2021
Proper connection and proper-walk connection of digraphs.
Appl. Math. Comput., 2021
2020
From light edges to strong edge-colouring of 1-planar graphs.
Discret. Math. Theor. Comput. Sci., 2020
Incidence coloring-cold cases.
Discuss. Math. Graph Theory, 2020
Distinguishing numbers and distinguishing indices of oriented graphs.
Discret. Appl. Math., 2020
A connected version of the graph coloring game.
Discret. Appl. Math., 2020
Broadcasts on paths and cycles.
Discret. Appl. Math., 2020
Homomorphisms of Sparse Signed Graphs.
Electron. J. Comb., 2020
2019
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.
Discret. Math. Theor. Comput. Sci., 2019
2-distance colorings of integer distance graphs.
Discuss. Math. Graph Theory, 2019
Oriented colourings of graphs with maximum degree three and four.
Discret. Math., 2019
On the distinguishing number of cyclic tournaments: Towards the Albertson-Collins Conjecture.
Discret. Appl. Math., 2019
Incidence choosability of graphs.
Discret. Appl. Math., 2019
Edge weights and vertex colours: Minimizing sum count.
Discret. Appl. Math., 2019
Every planar graph with Δ≥8 is totally (Δ+2)-choosable.
CoRR, 2019
2018
Octal games on graphs: The game 0.33 on subdivided stars and bistars.
Theor. Comput. Sci., 2018
Int. J. Game Theory, 2018
A Study of k-dipath Colourings of Oriented Graphs.
Discret. Math. Theor. Comput. Sci., 2018
Rainbow connections in digraphs.
Discret. Appl. Math., 2018
Strong rainbow connection in digraphs.
Discret. Appl. Math., 2018
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture.
Discret. Appl. Math., 2018
On the broadcast independence number of caterpillars.
Discret. Appl. Math., 2018
Packing colouring of some classes of cubic graphs.
CoRR, 2018
2017
Packing coloring of some undirected and oriented coronae graphs.
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
2016
i-Mark: A new subtraction division game.
Theor. Comput. Sci., 2016
Outerplanar and Planar Oriented Cliques.
J. Graph Theory, 2016
Homomorphisms and colourings of oriented graphs: An updated survey.
Discret. Math., 2016
On the packing coloring of undirected and oriented generalized theta graphs.
Australas. J Comb., 2016
2015
Homomorphisms of Signed Graphs.
J. Graph Theory, 2015
The incidence game chromatic number of (a, d)-decomposable graphs.
J. Discrete Algorithms, 2015
On the complexity of determining the irregular chromatic index of a graph.
J. Discrete Algorithms, 2015
Dicots, and a taxonomic ranking for misère games.
J. Comb. Theory A, 2015
An oriented version of the 1-2-3 Conjecture.
Discuss. Math. Graph Theory, 2015
2014
Partitioning Harary graphs into connected subgraphs containing prescribed vertices.
Discret. Math. Theor. Comput. Sci., 2014
Complete oriented colourings and the oriented achromatic number.
Discret. Appl. Math., 2014
Rainbow connection in oriented graphs.
Discret. Appl. Math., 2014
2013
Homomorphisms of planar signed graphs to signed projective cubes.
Discret. Math. Theor. Comput. Sci., 2013
The incidence chromatic number of toroidal grids.
Discuss. Math. Graph Theory, 2013
Incidence Coloring Game and Arboricity of Graphs.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013
2012
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs.
Discuss. Math. Graph Theory, 2012
2010
Coloring the square of the Cartesian product of two cycles.
Discret. Math., 2010
Homomorphisms of 2-edge-colored graphs.
Discret. Appl. Math., 2010
2009
Compound Node-Kayles on paths.
Theor. Comput. Sci., 2009
Chromatic number of sparse colored mixed planar graphs.
Electron. Notes Discret. Math., 2009
Incidence coloring of the Cartesian product of two cycles
CoRR, 2009
2008
On the oriented chromatic index of oriented graphs.
J. Graph Theory, 2008
2006
Oriented vertex and arc colorings of outerplanar graphs.
Inf. Process. Lett., 2006
On the oriented chromatic number of Halin graphs.
Inf. Process. Lett., 2006
The acircuitic directed star arboricity of subcubic graphs is at most four.
Discret. Math., 2006
On the oriented chromatic number of graphs with given excess.
Discret. Math., 2006
2005
On the maximum average degree and the incidence chromatic number of a graph.
Discret. Math. Theor. Comput. Sci., 2005
2004
Incidence coloring of k-degenerated graphs.
Discret. Math., 2004
2002
Acyclic list 7-coloring of planar graphs.
J. Graph Theory, 2002
Nilpotent Families of Endomorphisms of (p(V)+, cup).
J. Comb. Theory B, 2002
There exist oriented planar graphs with oriented chromatic number at least sixteen.
Inf. Process. Lett., 2002
2001
On Deeply Critical Oriented Graphs.
J. Comb. Theory B, 2001
Acyclic colouring of 1-planar graphs.
Discret. Appl. Math., 2001
On the Oriented Game Chromatic Number.
Electron. J. Comb., 2001
Small k-Dominating Sets in Planar Graphs with Applications.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001
1999
Acrylic improper colorings of graphs.
J. Graph Theory, 1999
On the maximum average degree and the oriented chromatic number of a graph.
Discret. Math., 1999
1998
On universal graphs for planar oriented graphs of a given girth.
Discret. Math., 1998
1997
The chromatic number of oriented graphs.
J. Graph Theory, 1997
Acyclic and oriented chromatic numbers of graphs.
J. Graph Theory, 1997
Colorings and girth of oriented planar graphs.
Discret. Math., 1997
Graph Relabelling Systems: A General Overview.
Comput. Artif. Intell., 1997
On the minimum number of edges giving maximum oriented chromatic number.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
Acyclic improper colourings of graphs with bounded degree.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
1996
Expanding Graph Relabeling Systems have the Power of Recursive Enumerability.
Fundam. Informaticae, 1996
1995
Different Local Controls for Graph Relabeling Systems.
Math. Syst. Theory, 1995
Checking global graph properties by means of local computations: the majority problem.
Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, 1995
1994
Good and Semi-Strong Colorings of Oriented Planar Graphs.
Inf. Process. Lett., 1994
1993
Some Combinatorial Aspects of Time-stamp Systems.
Eur. J. Comb., 1993
1992
Definitions and Comparisons of Local Computations on Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
1991
Hypermap Rewriting: A Combinatorial Approach.
Theor. Comput. Sci., 1991
1989
Graph Rewriting Systems with Priorities.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989
1988
Theor. Comput. Sci., 1988
1987
Combinatorial Hypermap Rewriting.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987
