3 papers
math.CO2022
Two New Characterizations of Path Graphs
Nicola Apollonio, Lorenzo Balzotti
Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths i…
cs.DM2014
Minimally unbalanced diamond-free graphs and Dyck-paths
N. Apollonio, A. Galluccio
A -matrix is balanced if it does not contain a submatrix of odd order having exactly two 1's per row and per column. A graph is balanced if its clique-matrix…
cs.DM2014
On the Galois Lattice of Bipartite Distance Hereditary Graphs
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
We give a complete characterization of bipartite graphs having tree-like Galois lattices. We prove that the poset obtained by deleting bottom and top elements from the Galois latti…