Results 71 to 80 of about 7,242 (121)
Evolutionary analysis of Trehalose breakdown pathways
Ganesh Muthu G +2 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Two Completely Independent Spanning Trees of $$P_4$$-Free Graphs
Graphs and Combinatorics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xiaodong +2 more
openaire +2 more sources
Two completely independent spanning trees of split graphs
Discrete Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xiaodong, Liu, Qinghai, Yang, Xiwu
openaire +2 more sources
Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs
Graphs and Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Yuan, Ru Zhang, Aixia Liu
openaire +2 more sources
Two completely independent spanning trees of claw-free graphs
Discrete Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xiaodong +2 more
openaire +1 more source
Degree condition for completely independent spanning trees
Information Processing Letters, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong, Xia, Liu, Qinghai
openaire +1 more source
Completely independent spanning trees in torus networks
Networks, 2011AbstractLet T1, T2, …, Tk be spanning trees in a graph G. If for any two vertices u, v in G, the paths from u to v in T1, T2, …, Tk are pairwise internally disjoint, then T1, T2, …, Tk are completely independent spanning trees in G. Completely independent spanning trees can be applied to fault‐tolerant communication problems in interconnection networks.
Hasunuma, Toru, Morisaka, Chie
openaire +2 more sources
A Hamilton sufficient condition for completely independent spanning tree
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong, Xia, Zhang, Huihui
openaire +1 more source
Dirac's Condition for Completely Independent Spanning Trees
Journal of Graph Theory, 2013AbstractTwo 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. In this article, we show two sufficient conditions for the existence of completely independent spanning trees. First, we show that a graph of n vertices has two completely independent
openaire +1 more source
Comments on “A Hamilton sufficient condition for completely independent spanning tree”
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiao-Wen Qin +3 more
openaire +2 more sources