Covering all cliques of a graph (Q1174130): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127673832, #quickstatements; #temporary_batch_1721913393134
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zsolt Tuza / rank
Normal rank
 
Property / author
 
Property / author: Zsolt Tuza / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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