On stable cutsets in graphs-Reference-Cited by-同舟云学术

On stable cutsets in graphs

Published:2000-10 Issue:1-3 Volume:105 Page:39-50
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Brandstädt Andreas,Dragan Feodor F.,Le Van Bang,Szymczak Thomas

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference19 articles.

1. Chordality properties on graphs and minimal conceptual connections in semantic data models;Ausiello;J. Comput. System Sci.,1986

2. Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, Vol. 3;Brandstädt,1999

3. Recognizing decomposable graphs;Chvátal;J. Graph Theory,1984

4. V. Chvátal et al., Collection of problems concerning perfect graphs, Dimacs Workshop on Perfect Graphs, Princeton, 1993, ftp://dimacs.rutgers.edu/pub/perfect/problems.tex.

5. Stable set bonding in perfect graphs and parity graphs;Corneil;J. Combin. Theory Ser. B,1993

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

1. Complexity and Algorithm for the Matching Cutset Problem;2024

2. Exact and Parameterized Algorithms for the Independent Cutset Problem;Fundamentals of Computation Theory;2023

3. Vertex partitioning problems on graphs with bounded tree width;Discrete Applied Mathematics;2021-06

4. On some combinatorial problems in cographs;International Journal of Advances in Engineering Sciences and Applied Mathematics;2019-02-25

5. The Sandwich Problem for Decompositions and Almost Monotone Properties;Algorithmica;2018-01-19