Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs.


https://doi.org/10.1016/j.jctb.2004.03.002
@article{DBLP:journals/jct/DengLZ04, author = {Xiaotie Deng and Guojun Li and Wenan Zang}, title = {Proof of Chv{\'{a}}tal's conjecture on maximal stable sets and maximal cliques in graphs}, journal = {J. Comb. Theory, Ser. {B}}, volume = {91}, number = {2}, pages = {301--325}, year = {2004}, url = {https://doi.org/10.1016/j.jctb.2004.03.002}, doi = {10.1016/j.jctb.2004.03.002}, timestamp = {Fri, 27 Mar 2020 08:45:03 +0100}, biburl = {https://dblp.org/rec/journals/jct/DengLZ04.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