Completely Independent Spanning Trees in k-Th Power of Graphs
Discussiones Mathematicae Graph Theory, 2018 Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of
Hong Xia
doaj +1 more source
Boundary behaviour of λ -polyharmonic functions on regular trees. [PDF]
Ann Mat Pura Appl, 2021 Sava-Huss E, Woess W.
europepmc +1 more source
A combinatorial identity for rooted labeled forests. [PDF]
Aequ Math, 2020 Hackl B.
europepmc +1 more source
The hybrid number of a ploidy profile. [PDF]
J Math Biol, 2022 Huber KT, Maher LJ.
europepmc +1 more source
Enumeration of coalescent histories for caterpillar species trees and p-pseudocaterpillar gene trees. [PDF]
Adv Appl Math, 2021 Alimpiev E, Rosenberg NA.
europepmc +1 more source
Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes. [PDF]
J Math Biol, 2021 Gross E +5 more
europepmc +1 more source
An efficient characterization of submodular spanning tree games. [PDF]
Math Program, 2020 Koh ZK, Sanità L.
europepmc +1 more source
The rigid hybrid number for two phylogenetic trees. [PDF]
J Math Biol, 2021 Huber KT, Linz S, Moulton V.
europepmc +1 more source
Categorification of Hopf algebras of rooted trees
Open Mathematics, 2013 Kock Joachim
doaj +1 more source
Admissions to intensive cardiac care units in France in 2014: A cross-sectional, nationwide population-based study. [PDF]
Medicine (Baltimore), 2018 Mercier G +9 more
europepmc +1 more source