Graphs with Most Number of Three Point Induced Connected Subgraphs.
https://doi.org/10.1016/0166-218X(93)E0155-R
@article{DBLP:journals/dam/BoeschLR95,
author = {Francis T. Boesch and
Xiaoming Li and
Jos{\'{e}} Rodr{\'{\i}}guez},
title = {Graphs with Most Number of Three Point Induced Connected Subgraphs},
journal = {Discret. Appl. Math.},
volume = {59},
number = {1},
pages = {1--10},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(93)E0155-R},
doi = {10.1016/0166-218X(93)E0155-R},
timestamp = {Thu, 20 Feb 2020 15:49:09 +0100},
biburl = {https://dblp.org/rec/journals/dam/BoeschLR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签