On the maximum number of cliques in a graph embedded in a surface (Q648982): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejc.2011.04.001
@@ Property / DOI: 10.1016/j.ejc.2011.04.001 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W1985880617
@@ Property / OpenAlex ID: W1985880617 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4142
@@ Property / arXiv ID: 0906.4142 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating the triangulations of the projective plane
+Normal rank
@@ Property / cites work @@
+All 2-manifolds have finitely many minimal triangulations
+Normal rank
@@ Property / cites work @@
+Hierarchy of surface models and irreducible triangulations.
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of triangles in a \(K_4\)-free graph
+Normal rank
@@ Property / cites work @@
+Rank-width and tree-width of \(H\)-minor-free graphs
+Normal rank
@@ Property / cites work @@
+Irreducible triangulations are small
@@ Property / cites work: Irreducible triangulations are small / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal triangulations on orientable surfaces
@@ Property / cites work: Minimal triangulations on orientable surfaces / rank @@
+Normal rank
@@ Property / cites work @@
+Q3766517
@@ Property / cites work: Q3766517 / rank @@
+Normal rank
@@ Property / cites work @@
+Irreducible triangulations of the Klein bottle
@@ Property / cites work: Irreducible triangulations of the Klein bottle / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on irreducible triangulations of surfaces
@@ Property / cites work: Note on irreducible triangulations of surfaces / rank @@
+Normal rank
@@ Property / cites work @@
+Proper minor-closed families are small
@@ Property / cites work: Proper minor-closed families are small / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm to find a separator in a graph excluding a minor
+Normal rank
@@ Property / cites work @@
+Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
+Normal rank
@@ Property / cites work @@
+Q4757462
@@ Property / cites work: Q4757462 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on the irreducible triangulations of the Klein bottle
+Normal rank
@@ Property / cites work @@
+Q3344220
@@ Property / cites work: Q3344220 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of cliques in a graph
@@ Property / cites work: On the maximum number of cliques in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5790850
@@ Property / cites work: Q5790850 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJC.2011.04.001
@@ Property / DOI: 10.1016/J.EJC.2011.04.001 / rank @@
+Normal rank