Packing of graphs with small product of sizes (Q958696): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Packings of graphs and applications to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Edge Graphs II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two Conjectures on Packing of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing \(d\)-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal result for subgraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdös-Stone Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing two graphs of order n having total size at most 2n-2 / rank
 
Normal rank

Latest revision as of 21:23, 28 June 2024

scientific article
Language Label Description Also known as
English
Packing of graphs with small product of sizes
scientific article

    Statements

    Identifiers