dblp.uni-trier.dewww.uni-trier.de

Baoyindureng Wu

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
13EEXinhui An, Baoyindureng Wu: The Wiener index of the kth power of a graph. Appl. Math. Lett. 21(5): 436-440 (2008)
12 Baoyindureng Wu, Li Zhang: Disproof of a Conjecture on List Coloring. Ars Comb. 89: (2008)
11EELan Xu, Baoyindureng Wu: Transformation graph G-+-. Discrete Mathematics 308(22): 5144-5148 (2008)
10EEBaoyindureng Wu, Li Zhang: The minimum number of vertices for a triangle-free graph with chil(G)=4 is 11. Discrete Mathematics 308(23): 5342-5348 (2008)
9EEBaoyindureng Wu, Xiaoping Liu, Xiaofeng Guo: Super-connected and hyper-connected jump graphs. Int. J. Comput. Math. 85(12): 1765-1769 (2008)
2007
8EEXinhui An, Baoyindureng Wu: Hamiltonicity of complements of middle graphs. Discrete Mathematics 307(9-10): 1178-1184 (2007)
2006
7EEBaoyindureng Wu, Li Zhang: Extension of a list coloring problem. Appl. Math. Lett. 19(2): 135-139 (2006)
6EELi Zhang, Baoyindureng Wu: A note on the cover degeneracy of graphs. Journal of Graph Theory 51(2): 170-173 (2006)
2005
5EEGuoyan Ma, Baoyindureng Wu: Hamiltonicity of Complements of Total Graphs. CJCDGCGT 2005: 109-119
4EEBaoyindureng Wu, Li Zhang, Zhao Zhang: The transformation graph Gxyz when xyz=-++. Discrete Mathematics 296(2-3): 263-270 (2005)
3EELi Zhang, Baoyindureng Wu: A note on 3-choosability of planar graphs without certain cycles. Discrete Mathematics 297(1-3): 206-209 (2005)
2004
2EELi Zhang, Baoyindureng Wu: Edge choosability of planar graphs without small cycles. Discrete Mathematics 283(1-3): 289-293 (2004)
1EEBaoyindureng Wu, Jixiang Meng: Hamiltonian jump graphs. Discrete Mathematics 289(1-3): 95-106 (2004)

Coauthor Index

1Xinhui An [8] [13]
2Xiaofeng Guo [9]
3Xiaoping Liu [9]
4Guoyan Ma [5]
5Jixiang Meng [1]
6Lan Xu [11]
7Li Zhang [2] [3] [4] [6] [7] [10] [12]
8Zhao Zhang [4]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)