( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs.

, , и . Discret. Math. Algorithms Appl., (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Zhang Zhang

Meng Zhang

Methods and implementations of road-network matching. TU München, (2009)

Le Zhang

Yue Zhang

Xianghui Zhang

 

Другие публикации лиц с тем же именем

Properly colored $C_4$'s in edge-colored graphs., , и . CoRR, (2019)Heavy cycles in k-connected weighted graphs., , и . Electron. Notes Discret. Math., (2004)Algorithms for symmetric groups of simplexes., и . Appl. Math. Comput., 188 (2): 1610-1634 (2007)Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs., , и . Discret. Math. Algorithms Appl., (2014)Computing the connectivity indices of α- and β-cyclodextrins., и . BIBM Workshops, стр. 107-112. IEEE, (2010)Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums., , и . International Conference on Computational Science (3), том 4489 из Lecture Notes in Computer Science, стр. 338-346. Springer, (2007)Graphs with minimum degree-entropy., , , и . Inf. Sci., (2024)Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs., , , и . J. Comb. Optim., 45 (2): 73 (марта 2023)Vulnerability parameters of split graphs., , и . Int. J. Comput. Math., 85 (1): 19-23 (2008)An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs., , и . CJCDGCGT, том 4381 из Lecture Notes in Computer Science, стр. 21-29. Springer, (2005)