Recognizing Well Covered Graphs of Families with Special P 4-Components-Reference-Cited by-同舟云学术

Recognizing Well Covered Graphs of Families with Special P 4-Components

Published:2011-12-29 Issue:3 Volume:29 Page:553-567
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Klein S.,de Mello C. P.,Morgana A.

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00373-011-1123-1.pdf

Reference26 articles.

1. Baumann, S.: A linear algorithm for the homogeneous decomposition of graphs. Report No. M-9615, Zentrum Mathematik, Technische Universität München (1996)

2. Caro Y.: Subdivisions, parity and well-covered graphs. J. Graph Theory 25, 85–94 (1997)

3. Caro Y., Sebö A., Tarsi M.: Recognizing greedy structures. J. Algorithms 20, 137–156 (1996)

4. Chvátal V., Slater P.J.: A note on well-covered graphs. Ann. Discrete Math. 55, 179–182 (1993)

5. Corneil D.G., Lerchs H., Stewart Burlingham L.: Complement reducible graphs. Discrete Appl. Math. 3, 163–174 (1981)

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

1. Recognizing well-dominated graphs is coNP-complete;Information Processing Letters;2024-01

2. Computing well-covered vector spaces of graphs using modular decomposition;Computational and Applied Mathematics;2023-11-22

3. On the probe problem for (r,ℓ)-well-coveredness: Algorithms and complexity;Theoretical Computer Science;2022-10

4. On the Probe Problem for $$(r,\ell )$$-Well-Coveredness;Lecture Notes in Computer Science;2021

5. Graphs with few P4’s under the convexity of paths of order three;Discrete Applied Mathematics;2015-09