首页> 外文OA文献 >Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3

【2h】

Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3

机译：2-Clique着色的分层复杂性弱弦曲线图和具有至少3的派系的完美图

代理获取

本网站仅为用户提供外文OA文献查询和代理获取服务，本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文，但由于OA文献来源多样且变更频繁，仍可能出现获取不到、文献不完整或与标题不符等情况，如果获取不到我们将提供退款服务。请知悉。

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Hélio B. Macêdo Filho; Raphael C.S. Machado; Celina M.H. de Figueiredo;
展开▼
作者单位

展开▼
年度 2016
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
专利

1. Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 [J] . Macedo Filho Helio B., Machado Raphael C. S., de Figueiredo Celina M. H. Theoretical computer science . 2016,第Null期

机译：2-cli-colored弱弦和图和具有至少3个集团的完美图的层级复杂性
2. Optimal-size clique transversals in chordal graphs [J] . Cooper Jacob W., Grzesik Andrzej, Kral Daniel Journal of Graph Theory . 2018,第3a4期

机译：Chordal图中的最佳大小集团横向
3. Optimal-size clique transversals in chordal graphs [J] . Cooper Jacob W., Grzesik Andrzej, Kral Daniel Journal of Graph Theory . 2018,第3a4期

机译：Chordal图中的最佳大小集团横向
4. Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3 [C] . Helio B. Macedo Filho, Raphael C.S. Machado, Celina M.H. Figueiredo Latin American symposium on theoretical informatics . 2014

机译：2色上色弱的和弦图和具有最小大小组的完美图的层次复杂性
5. Finding a maximum clique of a chordal graph by removing vertices of minimum degree [D] . Bhaduri, Sudipta 2008

机译：通过删除最小度数的顶点来找到弦图的最大集团
6. Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs [O] . Chunmei Liu, Yinglei Song -1

机译：参数化复杂性在十字和邻近Chordal图中占据主导地位问题的难以理解
7. Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3 [O] . Helio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. Figueiredo 2014

机译：2-Clique着色的分层复杂性弱弦曲线图和具有至少3的派系的完美图

Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3

著录项

引文网络

相似文献

相关主题

期刊订阅