Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
Kenneth Kunen (1989)
Fundamenta Mathematicae
Similarity:
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
Keith Devlin (1983)
Fundamenta Mathematicae
Similarity:
John Jobe (1975)
Fundamenta Mathematicae
Similarity:
Keith Devlin (1983)
Fundamenta Mathematicae
Similarity:
Keh-Hsun Chen, Zbigniew W. Ras (1988)
Banach Center Publications
Similarity:
Teruyuki Yorioka (2008)
Fundamenta Mathematicae
Similarity:
We introduce a generalization of a Dowker space constructed from a Suslin tree by Mary Ellen Rudin, and the rectangle refining property for forcing notions, which modifies the one for partitions due to Paul B. Larson and Stevo Todorčević and is stronger than the countable chain condition. It is proved that Martin's Axiom for forcing notions with the rectangle refining property implies that every generalized Rudin space constructed from Aronszajn trees is non-Dowker, and that the same...
Jaroslav Nešetřil (1972)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
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...