Maximising the number of induced cycles in a graph (Q2399349): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Triangle-free graphs with the maximum number of cycles / 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: Q3795701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inducibility of blow-up graphs / 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: The inducibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems on cycles and colorings / rank
 
Normal rank

Revision as of 06:56, 14 July 2024

scientific article
Language Label Description Also known as
English
Maximising the number of induced cycles in a graph
scientific article

    Statements

    Identifiers