Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs.


https://doi.org/10.1007/s10878-015-9917-3
@article{DBLP:journals/jco/ChenLLTWX16, author = {Hao Chen and Zihan Lei and Tian Liu and Ziyang Tang and Chaoyi Wang and Ke Xu}, title = {Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs}, journal = {J. Comb. Optim.}, volume = {32}, number = {1}, pages = {95--110}, year = {2016}, url = {https://doi.org/10.1007/s10878-015-9917-3}, doi = {10.1007/s10878-015-9917-3}, timestamp = {Wed, 29 Aug 2018 17:16:58 +0200}, biburl = {https://dblp.org/rec/journals/jco/ChenLLTWX16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21