Linear Clique-Width for Hereditary Classes of Cographs

被引：9

作者：

Brignall, Robert ^{[1
]}

Korpelainen, Nicholas ^{[2
]}

Vatter, Vincent ^{[3
]}

机构：

[1] Open Univ, Dept Math & Stat, Milton Keynes, Bucks, England

[2] Univ Derby, Math Dept, Derby, England

[3] Univ Florida, Dept Math, Gainesville, FL 32611 USA

来源：

JOURNAL OF GRAPH THEORY | 2017年 / 84卷 / 04期

基金：

英国工程与自然科学研究理事会;

关键词：

linear clique-width; cographs; threshold graphs; quasi-threshold graphs; clique-width; NLC-WIDTH; GRAPHS;

D O I：

10.1002/jgt.22037

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The class of cographs is known to have unbounded linear clique-width. We prove that a hereditary class of cographs has bounded linear clique-width if and only if it does not contain all quasi-threshold graphs or their complements. The proof borrows ideas from the enumeration of permutation classes. (C) 2016 Wiley Periodicals, Inc.

引用

页码：501 / 511

页数：11

共 50 条

[41] Clique-width: Harnessing the power of atoms
Dabrowski, Konrad K. K.
Masarik, Tomas
Novotna, Jana
Paulusma, Daniel
Rzazewski, Pawel
JOURNAL OF GRAPH THEORY, 2023, 104 (04) : 769 - 810
[42] CLIQUE-WIDTH IS NP-COMPLETE
Fellows, Michael R.
Rosamond, Frances A.
Rotics, Udi
Szeider, Stefan
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (02) : 909 - 939
[43] Bipartite Graphs of Large Clique-Width
Korpelainen, Nicholas
Lozin, Vadim V.
COMBINATORIAL ALGORITHMS, 2009, 5874 : 385 - +
[44] Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
B. Courcelle
J. A. Makowsky
U. Rotics
Theory of Computing Systems, 2000, 33 : 125 - 150
[45] Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
Coudert, David
Ducoffe, Guillaume
Popa, Alexandru
ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (03)
[46] Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
Coudert, David
Ducoffe, Guillaume
Popa, Alexandru
SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2765 - 2784
[47] NCE graph grammars and clique-width
Glikson, A
Makowsky, JA
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2003, 2880 : 237 - 248
[48] Alliances in graphs of bounded clique-width
Otachi, Yota (otachi@jaist.ac.jp), 2017, Elsevier B.V., Netherlands (223)
[49] Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Heggernes, Pinar
Meister, Daniel
Papadopoulos, Charis
DISCRETE APPLIED MATHEMATICS, 2012, 160 (06) : 888 - 901
[50] Linear time solvable optimization problems on graphs of bounded clique-width
Courcelle, B
Makowsky, JA
Rotics, U
THEORY OF COMPUTING SYSTEMS, 2000, 33 (02) : 125 - 150

← 1 2 3 4 5 →