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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Covering the cliques of a graph with vertices
@@ Property / cites work: Covering the cliques of a graph with vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of strongly chordal graphs
@@ Property / cites work: Characterizations of strongly chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3270978
@@ Property / cites work: Q3270978 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3708835
@@ Property / cites work: Q3708835 / rank @@
+Normal rank
@@ Property / cites work @@
+Helly-type hypergraphs and Sperner families
@@ Property / cites work: Helly-type hypergraphs and Sperner families / rank @@
+Normal rank
@@ Property / cites work @@
+Transversal numbers of uniform hypergraphs
@@ Property / cites work: Transversal numbers of uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-transversal sets of line graphs and complements of line graphs
+Normal rank
@@ Property / cites work @@
+An upper bound for the transversal numbers of 4-uniform hypergraphs
+Normal rank