Pure simplicial complexes and well-covered graphs (Q491349): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05E40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05E45 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 13F55 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6475252 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
well-covered graph | |||
Property / zbMATH Keywords: well-covered graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pure simplicial complex | |||
Property / zbMATH Keywords: pure simplicial complex / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
clique cover | |||
Property / zbMATH Keywords: clique cover / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
perfect graph | |||
Property / zbMATH Keywords: perfect graph / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1104.4556 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2962678536 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:01, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pure simplicial complexes and well-covered graphs |
scientific article |
Statements
Pure simplicial complexes and well-covered graphs (English)
0 references
25 August 2015
0 references
well-covered graph
0 references
pure simplicial complex
0 references
clique cover
0 references
perfect graph
0 references