#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1998

2000

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hajo Broersma, Hilde Tuinstra
- Journal of Graph Theory
- 1998

- Hajo Broersma, Otto R. Koppius, +4 authors Haiko Müller
- Networks
- 2000

We consider the degree-preserving spanning tree (DPST) problem: Given a connected graph G, find a spanning tree T of G such that as many vertices of T as possible have the same degree in T as in G. This problem is a graph-theoretical translation of a problem arising in the system-theoretical context of identifiability in networks, a concept which has… (More)

- Hajo Broersma, Andreas Huck, +4 authors Hilde Tuinstra
- MFCS
- 1998

If G is a 4-connected maximal planar graph, then G is hamiltonian (by a theorem of Whitney), implying that its dual graph G∗ is a cyclically 4-edge connected 3regular planar graph admitting a partition of the vertex set into two parts, each inducing a tree in G∗, a so-called tree-partition. It is a natural question whether each cyclically 4-edge connected… (More)

- ‹
- 1
- ›