Counting cliques in 1-planar graphs (Q2111191): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on 1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for graphs embeddable with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1,λ)-EMBEDDED GRAPHS AND THE ACYCLIC EDGE CHOOSABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cycles of lengthk in a maximal planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680852 / 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: On the number of pentagons in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of five-cycles in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Entropy Approach to the Hard-Core Model on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Regular Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for independent set enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of cliques in a graph embedded in a surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in graphs excluding a complete graph minor / 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: Rank-width and tree-width of \(H\)-minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of Cliques in Graphs with a Forbidden Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cliques in graphs with a forbidden minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Struktur 1‐planarer Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-embeddings of Maximum 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal non-1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements on the density of maximal 1‐planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing and recognizing 4-map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Book embeddings of nonplanar graphs with small faces in few pages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3548359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über 1-optimale Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank

Latest revision as of 05:56, 31 July 2024

scientific article
Language Label Description Also known as
English
Counting cliques in 1-planar graphs
scientific article

    Statements

    Counting cliques in 1-planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 December 2022
    0 references
    maximum total number of cliques
    0 references
    maximum number of cliques of any fixed size
    0 references
    extremal graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references