F. Romaniello

most citedA sharp upper bound for the harmonious total chromatic number of graphs and multigraphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2024

An updated survey on 2-Factors of Regular Graphs

D. Labbate, F. Romaniello

A 2-factor of a graph $G$ is a 2-regular spanning subgraph of $G$ . We present a survey summarising results on the structure of 2-factors in regular graphs, as achieved by various r…

math.CO2024★ 1 cited

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs

M. Abreu, J. B. Gauci, D. Mattiolo +4

A proper total colouring of a graph $G$ is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colour…

math.CO2022

A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture

M. Abreu, M. Funk, D. Labbate +1

A graph $G$ admiting a $2$ -factor is \textit{pseudo $2$ -factor isomorphic} if the parity of the number of cycles in all its $2$ -factors is the same. In [M. Abreu, A.A. Diwan, B. Ja…