F. Romaniello

activity

20152026

most citedEven Orientations and Pfaffian graphs

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

collaborators

Showing math.COShow all

16 papers · 1 filter

math.CO2026

The Pairing-Hamiltonian property in Cartesian products of graphs

Federico Romaniello

Let $G$ be a simple graph of even order at least four, and let $K_{G}$ denote the complete graph on $V (G)$ . A perfect matching of $K_{G}$ is called a pairing of $G$ . The graph $G$ has…

math.CO2025

The Gray graph is pseudo 2-factor isomorphic

Marien Abreu, Jan Goedgebeur, Jorik Jooken +2

A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that…

math.CO2024

The Perfect Matching Hamiltonian property in Prism and Crossed Prism graphs

Francesco Colangelo, Federico Romaniello

A graph $G$ has the \emph{Perfect Matching Hamiltonian property} (or for short, $G$ is $P M H$ ) if, for each one of its perfect matchings, there is another perfect matching of $G$ su…

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.CO2023

On 2-bisections and monochromatic edges in claw-free cubic multigraphs

Federico Romaniello

A $k$ -bisection of a multigraph $G$ is a partition of its vertex set into two parts of the same cardinality such that every component of each part has at most $k$ vertices. Cui and…

math.CO2023

The Pairing-Hamiltonian property in graph prisms

Marién Abreu, Giuseppe Mazzuoccolo, Federico Romaniello +1

Let $G$ be a graph of even order, and consider $K_{G}$ as the complete graph on the same vertex set as $G$ . A perfect matching of $K_{G}$ is called a pairing of $G$ . If for every pairi…

math.CO2023

A characterization of graphs with small palette index

Domenico Labbate, Davide Mattiolo, Giuseppe Mazzuoccolo +2

Given an edge-coloring of a graph $G$ , we associate to every vertex $v$ of $G$ the set of colors appearing on the edges incident with $v$ . The palette index of $G$ is defined as th…

math.CO2022

On a graph isomorphic to $N O^{+} (6, 2)$

Federico Romaniello, Valentino Smaldore

Let $Q^{+} (2 n - 1, 2)$ be a non-degenerate hyperbolic quadric of $P G (2 n - 1, 2)$ . Let $N O^{+} (2 n, 2)$ be the tangent graph, whose vertices are the points of $PG(2n-1,2) \setminus Q^{+}(2n…

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…

math.CO2021

The Automorphism Group of $N U (3, q^{2})$

Federico Romaniello, Valentino Smaldore

Let $H (n, q^{2})$ be a non-degenerate Hermitian variety of $P G (n, q^{2})$ , $n \geq 2$ . Let $N U (n + 1, q^{2})$ be the graph whose vertices are the points of $P G (n, q^{2}) ∖ H (n, q^{2})$ and…

math.CO2021

Betwixt and between 2-factor Hamiltonian and Perfect-Matching-Hamiltonian graphs

Federico Romaniello, Jean Paul Zerafa

A Hamiltonian graph is 2-factor Hamiltonian (2FH) if each of its 2-factors is a Hamiltonian cycle. A similar, but weaker, property is the Perfect-Matching-Hamiltonian property (PMH…

math.CO2021

Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs

Marién Abreu, John Baptist Gauci, Domenico Labbate +2

A graph $G$ has the Perfect-Matching-Hamiltonian property (PMH-property) if for each one of its perfect matchings, there is another perfect matching of $G$ such that the union of t…

math.CO2018

Strongly regular graphs from integral point sets in even dimensional affine spaces over finite fields

Gábor Korchmáros, Federico Romaniello, Tamás Szőnyi

In the $m$ -dimensional affine space $A G (m, q)$ over the finite field $F_{q}$ of odd order $q$ , the analogous of the Euclidean distance gives rise to a graph $\mathfrak{G}_{m,…

math.CO2015★ 1 cited

Even Orientations and Pfaffian graphs

Marièn Abreu, Domenico Labbate, Federico Romaniello +1

We give a characterization of Pfaffian graphs in terms of even orientations, extending the characterization of near bipartite non--pfaffian graphs by Fischer and Little \cite{FL}.…

math.CO2015

Characterization of graphs without even $F$ -orientations

M. Abreu, D. Labbate, F. Romaniello +1

A graph $G$ is $1$ -extendible if every edge belongs to at least one $1$ -factor of $G$ . Let $G$ be a graph with a $1$ -factor $F$ . Then an even $F$ -orientation of $G$ is an orientati…

The Pairing-Hamiltonian property in Cartesian products of graphs

The Gray graph is pseudo 2-factor isomorphic

The Perfect Matching Hamiltonian property in Prism and Crossed Prism graphs

An updated survey on 2-Factors of Regular Graphs

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

On 2-bisections and monochromatic edges in claw-free cubic multigraphs

The Pairing-Hamiltonian property in graph prisms

A characterization of graphs with small palette index

On a graph isomorphic to NO+(6,2)

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

The Automorphism Group of NU(3,q2)

Betwixt and between 2-factor Hamiltonian and Perfect-Matching-Hamiltonian graphs

Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs

Strongly regular graphs from integral point sets in even dimensional affine spaces over finite fields

Even Orientations and Pfaffian graphs

Characterization of graphs without even F-orientations

On a graph isomorphic to $N O^{+} (6, 2)$

The Automorphism Group of $N U (3, q^{2})$

Characterization of graphs without even $F$ -orientations