8 citations · 54 across the 39 of their papers we have counts for
4 papers · 1 filter
Odd 2-factored snarks
M. Abreu, D. Labbate, R. Rizzi +1
A {\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph is {\em odd 2-factored} if for each 2-fa…
Set graphs. II. Complexity of set graph recognition and similar problems
Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu
A graph is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinc…
Optimal Listing of Cycles and st-Paths in Undirected Graphs
Rui Ferreira, Roberto Grossi, Andrea Marino +3
We present the first optimal algorithm for the classical problem of listing all the cycles in an undirected graph. We exploit their properties so that the total cost is the time ta…
Some results on more flexible versions of Graph Motif
Romeo Rizzi, Florian Sikora
The problems studied in this paper originate from Graph Motif, a problem introduced in 2006 in the context of biological networks. Informally speaking, it consists in deciding if a…