3396 search results - page 33 / 680 » Tree representations of graphs |
WAOA
2007
Springer
14 years 2 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
DAGSTUHL
2010
13 years 10 months ago
2010
Many visual representations for trees have been developed in information and software visualization. One of them are cone trees, a well-known three-dimensional representation for ...
CCCG
2009
13 years 10 months ago
2009
We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.
FLOPS
2004
Springer
14 years 2 months ago
2004
Springer
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
COCOON
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...