4 search results - page 1 / 1 » Semiharmonic bicyclic graphs |
APPML
2005
13 years 4 months ago
2005
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...
DAM
2008
13 years 4 months ago
2008
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
ISMIS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...
CVPR
2012
IEEE
11 years 6 months ago
2012
IEEE
We propose a system for the automatic segmentation of novelties from the background in scenarios where multiple images of the same environment are available e.g. obtained by weara...