共 50 条
- [41] LOWER BOUND OF CONNECTIVITY IN CIRCULAR GRAPHS [J]. CHINESE SCIENCE BULLETIN, 1991, 36 (18): : 1579 - 1579
- [42] A Lower Bound for the Radio Number of Graphs [J]. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2019, 2019, 11394 : 161 - 173
- [45] The tight upper bound for the number of matchings of tricyclic graphs [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (01):
- [46] A TIGHT UPPER BOUND FOR GROUP-TESTING IN GRAPHS [J]. DISCRETE APPLIED MATHEMATICS, 1994, 48 (02) : 101 - 109
- [48] A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility [J]. SPAA 11: PROCEEDINGS OF THE TWENTY-THIRD ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2011, : 139 - 147