| Publication | Date of Publication | Type |
|---|
Some snarks are worse than others
European Journal of Combinatorics | 2024-01-23 | Paper |
On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
European Journal of Mathematics | 2023-11-08 | Paper |
A unified approach to construct snarks with circular flow number 5
Journal of Graph Theory | 2023-09-29 | Paper |
A unified approach to construct snarks with circular flow number 5
Journal of Graph Theory | 2023-09-29 | Paper |
| The Pairing-Hamiltonian property in graph prisms | 2023-07-10 | Paper |
On the existence of graphs which can colour every regular graph
Discrete Applied Mathematics | 2023-06-15 | Paper |
| A lower bound for the complex flow number of a graph: a geometric approach | 2023-03-17 | Paper |
3-regular matchstick graphs with given girth
(available as arXiv preprint) | 2023-03-13 | Paper |
| A characterization of graphs with small palette index | 2022-12-20 | Paper |
Graphs with large palette index
Discrete Mathematics | 2022-03-14 | Paper |
| On sublinear approximations for the Petersen coloring conjecture | 2021-09-13 | Paper |
On sublinear approximations for the Petersen coloring conjecture
(available as arXiv preprint) | 2021-09-13 | Paper |
Normal 5-edge-colorings of a family of Loupekhine snarks
AKCE International Journal of Graphs and Combinatorics | 2021-09-01 | Paper |
On 3-bisections in cubic and subcubic graphs
Graphs and Combinatorics | 2021-08-12 | Paper |
On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching
Discrete Applied Mathematics | 2021-06-14 | Paper |
Extending perfect matchings to Hamiltonian cycles in line graphs
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
Proceedings of the American Mathematical Society | 2020-09-03 | Paper |
Computational results and new bounds for the circular flow number of snarks
Discrete Mathematics | 2020-08-12 | Paper |
Computational results and new bounds for the circular flow number of snarks
Discrete Mathematics | 2020-08-12 | Paper |
An equivalent formulation of the Fan-Raspaud conjecture and related problems
Ars Mathematica Contemporanea | 2020-07-21 | Paper |
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
Journal of Graph Theory | 2020-07-17 | Paper |
Normal edge-colorings of cubic graphs
Journal of Graph Theory | 2020-05-21 | Paper |
Normal 6-edge-colorings of some bridgeless cubic graphs
Discrete Applied Mathematics | 2020-03-23 | Paper |
A family of multigraphs with large palette index
Ars Mathematica Contemporanea | 2020-02-21 | Paper |
Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
Discrete Mathematics | 2019-02-20 | Paper |
A note on 2-bisections of claw-free cubic graphs
Discrete Applied Mathematics | 2018-05-24 | Paper |
Cores, joins and the Fano-flow conjectures
Discussiones Mathematicae Graph Theory | 2018-01-10 | Paper |
Flows and bisections in cubic graphs
Journal of Graph Theory | 2017-09-26 | Paper |
| On the palette index of a graph: the case of trees | 2017-09-04 | Paper |
Nowhere-zero 5-flows on cubic graphs with oddness 4
Journal of Graph Theory | 2017-07-05 | Paper |
Treelike snarks
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
Treelike snarks
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
| Nowhere-zero 5-flows | 2016-10-14 | Paper |
Edge-colorings of 4-regular graphs with the minimum number of palettes
Graphs and Combinatorics | 2016-07-28 | Paper |
On the equitable total chromatic number of cubic graphs
Discrete Applied Mathematics | 2016-06-21 | Paper |
The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
Journal of Combinatorics | 2016-05-25 | Paper |
On the total coloring of generalized Petersen graphs
Discrete Mathematics | 2016-04-07 | Paper |
Excessive \([l, m\)-factorizations]
Discrete Mathematics | 2015-06-29 | Paper |
On the maximum fraction of edges covered by \(t\) perfect matchings in a cubic bridgeless graph
Discrete Mathematics | 2015-04-29 | Paper |
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
Journal of Graph Theory | 2014-10-09 | Paper |
Upper bounds for the automorphic chromatic index of a graph
Graphs and Combinatorics | 2014-09-19 | Paper |
On the excessive \([m\)-index of a tree]
Discrete Applied Mathematics | 2014-09-12 | Paper |
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
| Totally symmetric Kekulé structures in fullerene graphs with ten or more symmetries | 2014-03-26 | Paper |
Covering a cubic graph with perfect matchings
Discrete Mathematics | 2014-01-23 | Paper |
Covering cubic graphs with matchings of large size
The Australasian Journal of Combinatorics | 2013-09-26 | Paper |
An upper bound for the excessive index of an \(r\)-graph
Journal of Graph Theory | 2013-07-31 | Paper |
Perfect one-factorizations in generalized Petersen graphs.
Ars Combinatoria | 2012-10-08 | Paper |
Cyclic and dihedral 1-factorizations of multipartite graphs
The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
Cyclic and dihedral 1-factorizations of multipartite graphs
The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
The equivalence of two conjectures of Berge and Fulkerson
Journal of Graph Theory | 2011-10-12 | Paper |
The NP-completeness of automorphic colorings
Discussiones Mathematicae Graph Theory | 2011-05-09 | Paper |
Automorphic chromatic index of generalized Petersen graphs
AKCE International Journal of Graphs and Combinatorics | 2011-02-08 | Paper |
Computing the automorphic chromatic index of certain snarks
Results in Mathematics | 2010-11-17 | Paper |
On the automorphic chromatic index of a graph
Graphs and Combinatorics | 2010-11-12 | Paper |
Abelian 1-factorizations in infinite graphs
European Journal of Combinatorics | 2010-10-18 | Paper |
Sharply transitive 1-factorizations of complete multipartite graphs
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
Sharply transitive 1-factorizations of complete multipartite graphs
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
Journal of Combinatorial Designs | 2009-10-21 | Paper |
| Perfect one-factorizations in line-graphs and planar graphs | 2008-08-12 | Paper |
On 2-factorizations whose automorphism group acts doubly transitively on the factors
Discrete Mathematics | 2008-02-14 | Paper |
Primitive 2-factorizations of the complete graph
Discrete Mathematics | 2008-01-30 | Paper |
| scientific article; zbMATH DE number 5230851 (Why is no real title available?) | 2008-01-29 | Paper |
\(k\)-pyramidal one-factorizations
Graphs and Combinatorics | 2007-09-10 | Paper |
On perfectly one–factorable cubic graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On 2-factorizations with some symmetry
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Doubly transitive 2-factorizations
Journal of Combinatorial Designs | 2007-03-20 | Paper |
A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
(available as arXiv preprint) | N/A | Paper |
Non-double covered cubic graphs
(available as arXiv preprint) | N/A | Paper |
