Packing Graphs of Bounded Codegree (Q4962588): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Embedding Arbitrary Graphs of Maximum Degree Two / 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: Packing random graphs and hypergraphs / 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: Subgraphs of graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bollobás–Eldridge Conjecture for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near packing of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph packing conjecture by Bollobás, Eldridge and Catlin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank

Latest revision as of 05:42, 17 July 2024

scientific article; zbMATH DE number 6972743
Language Label Description Also known as
English
Packing Graphs of Bounded Codegree
scientific article; zbMATH DE number 6972743

    Statements

    Identifiers