Covering all cliques of a graph (Q1174130): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127673832, #quickstatements; #temporary_batch_1721913393134 |
||
(One intermediate revision by one other user not shown) | |||
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: Covering the cliques of a graph with vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of strongly chordal graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3270978 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3708835 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Helly-type hypergraphs and Sperner families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transversal numbers of uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Clique-transversal sets of line graphs and complements of line graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound for the transversal numbers of 4-uniform hypergraphs / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127673832 / rank | |||
Normal rank |
Latest revision as of 15:27, 25 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Covering all cliques of a graph |
scientific article |
Statements
Covering all cliques of a graph (English)
0 references
25 June 1992
0 references
covering all cliques
0 references
chordal graph
0 references