Bounding the Clique-Width ofH-Free Chordal Graphs

Author:

Brandstädt Andreas1,Dabrowski Konrad K.2,Huang Shenwei3,Paulusma Daniël2

Affiliation:

1. INSTITUTE OF COMPUTER SCIENCE; UNIVERSITÄT ROSTOCK; ALBERT-EINSTEIN-STRAßE 22 18059 ROSTOCK GERMANY

2. SCHOOL OF ENGINEERING AND COMPUTING SCIENCES; DURHAM UNIVERSITY, SCIENCE LABORATORIES; SOUTH ROAD DURHAM DH1 3LE UNITED KINGDOM

3. SCHOOL OF COMPUTING SCIENCE; SIMON FRASER UNIVERSITY; 8888 UNIVERSITY DRIVE, BURNABY B.C. V5A 1S6 CANADA

Funder

Engineering and Physical Sciences Research Council

Natural Sciences and Engineering Research Council of Canada

Simon Fraser University

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference60 articles.

1. Dominating sets for split and bipartite graphs;Bertossi;Inform Process Lett,1984

2. A. Blanché K. K. Dabrowski M. Johnson D. Paulusma Hereditary graph classes: When Colouring and Clique Cover coincide CoRR 2016

3. A tourist guide through treewidth;Bodlaender;Acta Cybernet,1993

4. R. Boliac V. V. Lozin On the clique-width of graphs in hereditary classes 2002 44 54

5. Graph classes with and without powers of bounded clique-width;Bonomo;Discrete Appl Math,2016

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3