A Berge-keeping operation for graphs (Q2433716): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Recursive generation of partitionable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The strong perfect graph theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizing Berge graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizing claw-free perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5183521 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect zero–one matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A semi-strong perfect graph theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On critical edges in minimal imperfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The connectivity of minimal imperfect graphs / rank | |||
Normal rank |
Latest revision as of 21:26, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Berge-keeping operation for graphs |
scientific article |
Statements
A Berge-keeping operation for graphs (English)
0 references
30 October 2006
0 references
coloration
0 references
property-keeping operation (minor)
0 references
perfect graphs
0 references
Berge graphs
0 references
odd hole
0 references
odd antihole
0 references