Recursively decomposable well-covered graphs (Q1356429): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3919752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3139761 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Very well covered graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some covering concepts in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity results for well‐covered graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(95)00232-l / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1991495793 / rank | |||
Normal rank |
Latest revision as of 12:00, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recursively decomposable well-covered graphs |
scientific article |
Statements
Recursively decomposable well-covered graphs (English)
0 references
17 September 1997
0 references
characterization
0 references
well-covered graphs
0 references
independent sets
0 references
recursively decomposable
0 references
isolated vertices
0 references