Direction Trees.
R.E. Jamison (1987)
Discrete & computational geometry
Similarity:
R.E. Jamison (1987)
Discrete & computational geometry
Similarity:
R. Kenyon, C. Kenyon (1992)
Discrete & computational geometry
Similarity:
H. Edelsbrunner, E. Welzl, P.K. Agarwal, O. Schwarzkopf (1991)
Discrete & computational geometry
Similarity:
M. Yvinec (1992)
Discrete & computational geometry
Similarity:
D. Eppstein (1995)
Discrete & computational geometry
Similarity:
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
G. Robins, J.S. Salowe (1995)
Discrete & computational geometry
Similarity:
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
Masayoshi Matsushita, Yota Otachi, Toru Araki (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such...
N. Alon, Y. Azar (1993)
Discrete & computational geometry
Similarity:
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity: