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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2008.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126113695 / rank
 
Normal rank
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 22:23, 28 June 2024

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

    Statements