Giuseppe Mazzuoccolo

Gloria Tabarelli

Jean Paul Zerafa

Discret. Appl. Math., October, 2023

A Characterization of Graphs with Small Palette Index.

[BibT_eX]

[DOI]

Symmetry, 2023

2022

Graphs with large palette index.

[BibT_eX]

[DOI]

Gloria Tabarelli

Discret. Math., 2022

2021

A unified approach to construct snarks with circular flow number 5.

[BibT_eX]

[DOI]

Jan Goedgebeur

J. Graph Theory, 2021

On 3-Bisections in Cubic and Subcubic Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching.

[BibT_eX]

[DOI]

Lorenzo Mella

Discret. Appl. Math., 2021

Extending Perfect Matchings to Hamiltonian Cycles in Line Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

On sublinear approximations for the Petersen coloring conjecture.

[BibT_eX]

[DOI]

Bull. ICA, 2021

2020

Normal edge-colorings of cubic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Computational results and new bounds for the circular flow number of snarks.

[BibT_eX]

[DOI]

Jan Goedgebeur

Discret. Math., 2020

Normal 6-edge-colorings of some bridgeless cubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

An equivalent formulation of the Fan-Raspaud Conjecture and related problems.

[BibT_eX]

[DOI]

Jean Paul Zerafa

Ars Math. Contemp., 2020

Normal 5-edge-colorings of a family of Loupekhine snarks.

[BibT_eX]

[DOI]

Luca Ferrarini

AKCE Int. J. Graphs Comb., 2020

2019

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations.

[BibT_eX]

[DOI]

Discret. Math., 2019

An algorithm and new bounds for the circular flow number of snarks.

[BibT_eX]

[DOI]

Jan Goedgebeur

CoRR, 2019

A family of multigraphs with large palette index.

[BibT_eX]

[DOI]

Maddalena Avesani

Arrigo Bonisoli

Ars Math. Contemp., 2019

2018

Cores, joins and the Fano-flow conjectures.

[BibT_eX]

[DOI]

Ligang Jin

Discuss. Math. Graph Theory, 2018

A note on 2-bisections of claw-free cubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Measures of Edge-Uncolorability of Cubic Graphs.

[BibT_eX]

[DOI]

Miquel A. Fiol

Electron. J. Comb., 2018

2017

Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Flows and Bisections in Cubic Graphs.

[BibT_eX]

[DOI]

Louis Esperet

Michael Tarsi

J. Graph Theory, 2017

2016

Edge-Colorings of 4-Regular Graphs with the Minimum Number of Palettes.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

Graphs Comb., 2016

On the total coloring of generalized Petersen graphs.

[BibT_eX]

[DOI]

Simone Dantas

Vinícius Fernandes dos Santos

Myriam Preissmann

Diana Sasaki

Discret. Math., 2016

On the equitable total chromatic number of cubic graphs.

[BibT_eX]

[DOI]

Simone Dantas

Celina M. H. de Figueiredo

Vinícius Fernandes dos Santos

Myriam Preissmann

Diana Sasaki

Discret. Appl. Math., 2016

Treelike Snarks.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Nowhere-zero 5-flows.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph.

[BibT_eX]

[DOI]

Louis Esperet

Discret. Math., 2015

Excessive [l, m]-factorizations.

[BibT_eX]

[DOI]

David Cariolaro

Discret. Math., 2015

2014

On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings.

[BibT_eX]

[DOI]

Louis Esperet

J. Graph Theory, 2014

Upper Bounds for the Automorphic Chromatic Index of a Graph.

[BibT_eX]

[DOI]

Beatrice Ruini

Graphs Comb., 2014

On the excessive [m]-index of a tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

An Upper Bound for the Excessive Index of an <i>r</i>-Graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

New conjectures on perfect matchings in cubic graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Invariant Kekulé structures in fullerene graphs.

[BibT_eX]

[DOI]

Mathieu Bogaerts

Electron. Notes Discret. Math., 2013

Covering a cubic graph with perfect matchings.

[BibT_eX]

[DOI]

Discret. Math., 2013

Covering cubic graphs with matchings of large size.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

Australas. J Comb., 2013

On total coloring and equitable total coloring of cubic graphs with large girth.

[BibT_eX]

Simone Dantas

Vinícius Fernandes dos Santos

Myriam Preissmann

Diana Sasaki

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011

The equivalence of two conjectures of Berge and Fulkerson.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Graphs of arbitrary excessive class.

[BibT_eX]

[DOI]

M. Young

Discret. Math., 2011

Cyclic and Dihedral 1-Factorizations of Multipartite Graphs.

[BibT_eX]

[DOI]

Mathieu Bogaerts

Electron. J. Comb., 2011

Perfect one-factorizations in generalized Petersen graphs.

[BibT_eX]

Ars Comb., 2011

2010

On the Automorphic Chromatic Index of a Graph.

[BibT_eX]

[DOI]

Carla Fiori

Beatrice Ruini

Graphs Comb., 2010

Abelian 1-factorizations in infinite graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

The NP-completeness of authomorphic colorings.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

Sharply Transitive 1-Factorizations of Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2008

On 2-factorizations whose automorphism group acts doubly transitively on the factors.

[BibT_eX]

[DOI]

Discret. Math., 2008

Primitive 2-factorizations of the complete graph.

[BibT_eX]

[DOI]

Discret. Math., 2008

Perfect one-factorizations in line-graphs and planar graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2008

2007

<i>k</i> -Pyramidal One-Factorizations.

[BibT_eX]

[DOI]

Graphs Comb., 2007

2006

On 2-factorizations with some symmetry.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

On perfectly one-factorable cubic graphs.

[BibT_eX]

[DOI]