On the structure and stability number of P5- and co-chair-free graphs-Reference-Cited by-同舟云学术

On the structure and stability number of P5- and co-chair-free graphs

Published:2003-10 Issue:1-3 Volume:132 Page:47-65
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Brandstädt Andreas,Mosca Raffaele

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference39 articles.

1. A polynomial algorithm for finding maximum independent sets in fork-free graphs;Alekseev;Discrete Anal. Oper. Res.,1999

2. On the stable set problem in (P5,diamond)-free graphs, Manuscript, 1998;Arbib;Discrete Math.,2002

3. A. Brandstädt, (P5,diamond)-Free Graphs Revisited: Structure, bounded clique width and linear time optimization, Technical Report CS-09-01, University of Rostock, 2001, Discrete Appl. Math., to appear.

4. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, Extended abstract in: Graph-Theoretic Concepts in Computer Science, 28 International Workshop, WG 2002, LNCS 2573, pp. 57–cepted for Theory of Computing Systems.

5. A. Brandstädt, C.T. Hoàng, V.B. Le, Stability number of bull- and chair-free graphs revisited, Technical Report CS-01-01, University of Rostock, 2001, Discrete Appl. Math., accepted.

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

1. Coloring (P5, kite)-free graphs with small cliques;Discrete Applied Mathematics;2024-02

2. On Graphs Without an Induced Path on 5 Vertices and Without an Induced Dart or Kite;Trends in Mathematics;2021

3. Independent Set on -Free Graphs in Quasi-Polynomial Time;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

4. On Indicated Coloring of Some Classes of Graphs;Graphs and Combinatorics;2019-07-13

5. Counting Perfect Matchings and the Switch Chain;SIAM Journal on Discrete Mathematics;2019-01