Near packings of graphs

zbMath1266.05127MaRDI QIDQ1953525

Andrzej Żak

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p36

zbMATH Keywords

spanning subgraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (1)

Near packings of two graphs

Cites Work

• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• Sparse graphs of girth at least five are packable
• A near packing of two graphs
• A note on packing graphs without cycles of length up to five
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement

This page was built for publication: Near packings of graphs