1199 search results - page 64 / 240 » Graph Theory |
108
Voted
DM
2008
15 years 3 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
118
Voted
AML
2010
15 years 3 months ago
2010
When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
150
click to vote
JCT
2006
15 years 3 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
118
Voted
EJC
2000
15 years 3 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
113
Voted
INFOVIS
2005
IEEE
15 years 9 months ago
2005
IEEE
The general problem of visualizing “family trees”, or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs...