共 50 条
- [1] ON UPPER-BOUNDS IN TREE-DIAMETER SETS OF GRAPHS IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1989, 36 (06): : 905 - 907
- [2] ON THE FEASIBLE TREE-DIAMETER SETS OF GRAPHS IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1985, 32 (08): : 862 - 864
- [6] Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter Appl Math Lett, 2 (131-137):
- [8] Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2013, 2013, 8165 : 298 - 309