(P5,diamond)-free graphs revisited: structure and linear time optimization-Reference-Cited by-同舟云学术

(P5,diamond)-free graphs revisited: structure and linear time optimization

Published:2004-03 Issue:1-2 Volume:138 Page:13-27
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Brandstädt Andreas

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference27 articles.

1. C. Arbib, R. Mosca, On the stable set problem in (P5, diamond)-free graphs, manuscript, 1995; Discrete Appl. Math., to appear.

2. Distance-hereditary graphs;Bandelt;J. Combin. Theory (B),1986

3. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, Extended abstract in: Theory of Computing Systems, Proceedings of WG2002, LNCS 2573 (2002) 57–67.

4. A. Brandstädt, C.T. Hoàng, J.-M. Vanherpe, On minimal prime extensions of a 4-vertex graph in a prime graph, manuscript, 2001.

5. A. Brandstädt, C.T. Hoàng, I. Zverovich, Extension of claw-free graphs and (K1 ∪ P4)-free graphs with substitution, Rutcor Research Report RRR 28-2001, 2001 http://rutcor.rutgers.edu/~rrr

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

1. Introducing lop-Kernels: A Framework for Kernelization Lower Bounds;Algorithmica;2022-06-03

2. On P5-free locally split graphs;Discussiones Mathematicae Graph Theory;2021

3. Sandwiches missing two ingredients of order four;Annals of Operations Research;2019-02-21

4. Triangle Packings and Transversals of Some $$K_{4}$$ K 4 -Free Graphs;Graphs and Combinatorics;2018-05-19

5. Colouring of $$(P_3 \cup P_2)$$(P3∪P2)-free graphs;Graphs and Combinatorics;2017-12-30