The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Symeon Bozapalidis, Antonios Kalampakas (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We display a complexity notion based on the syntax of a tree series which yields two distinct hierarchies, one within the class of recognizable tree series and another one in the class of non-recognizable tree series.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kuba, Markus, Panholzer, Alois (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Manes, K., Sapounakis, A., Tasoulas, I., Tsikouras, P. (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Wagner, Stephan G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Law, Hiu-Fai (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
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...
Jaroslav Nešetřil (1972)
Commentationes Mathematicae Universitatis Carolinae
Similarity: