中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
学科主题: Mathematics
题名:
proof of chvatals conjecture on maximal stable sets and maximal cliques in graphs
作者: Deng XT ; Li GJ ; Zang WN
关键词: 1 The work was partially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project CityU1056/01E).
刊名: JOURNAL OF COMBINATORIAL THEORY SERIES B
发表日期: 2004
卷: 91, 期:2, 页:301-325
收录类别: sci ; acm ; sciencedirect
部门归属: City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China. Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Univ Hong Kong, Dept Math, Hong Kon
语种: 英语
内容类型: 期刊论文
URI标识: http://ir.iscas.ac.cn/handle/311060/12902
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
proof of chvatals conjecture on maximal stable sets and maximal cliques in graphs.pdf(386KB)----限制开放-- 联系获取全文

Recommended Citation:
Deng XT,Li GJ,Zang WN. proof of chvatals conjecture on maximal stable sets and maximal cliques in graphs[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B,2004-01-01,91(2):301-325.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Deng XT]'s Articles
[Li GJ]'s Articles
[Zang WN]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Deng XT]‘s Articles
[Li GJ]‘s Articles
[Zang WN]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace