Algorithms on clique separable graphs (Q1246434): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On rigid circuit graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5341588 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Triangulated graphs and the elimination process / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5554163 / rank | |||
Normal rank |
Revision as of 22:29, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms on clique separable graphs |
scientific article |
Statements
Algorithms on clique separable graphs (English)
0 references
1977
0 references