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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985880617 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0906.4142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the triangulations of the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: All 2-manifolds have finitely many minimal triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchy of surface models and irreducible triangulations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of triangles in a \(K_4\)-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and tree-width of \(H\)-minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible triangulations are small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulations on orientable surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible triangulations of the Klein bottle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on irreducible triangulations of surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper minor-closed families are small / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm to find a separator in a graph excluding a minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4757462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the irreducible triangulations of the Klein bottle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of cliques in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank

Latest revision as of 16:32, 4 July 2024

scientific article
Language Label Description Also known as
English
On the maximum number of cliques in a graph embedded in a surface
scientific article

    Statements

    On the maximum number of cliques in a graph embedded in a surface (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 November 2011
    0 references
    maximum number of cliques
    0 references

    Identifiers