The maximum number of induced C5's in a planar graph (Q6057646): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3204672481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal number of induced \(r\)-partite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal number of induced complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inducibility of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the inducibility of 4-vertex graphs / 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: The Inducibility of Graphs on Four Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximising the number of induced cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimal Density of Triangles in Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:55, 3 August 2024

scientific article; zbMATH DE number 7746118
Language Label Description Also known as
English
The maximum number of induced C5's in a planar graph
scientific article; zbMATH DE number 7746118

    Statements

    Identifiers

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