Sparse graphs of girth at least five are packable

DOI10.1016/J.DISC.2012.08.014MaRDI QIDQ1759402zbMATH OpenOpenAlexFDO

Authors Andrzej Żak, Agnieszka Görlich

Publication date 20 November 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.08.014

zbMATH Keywords

planar graphssmall cyclespackable graphspacking graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Packing two graphs of even girth 10
• A note on packing graphs without cycles of length up to five
• Two theorems on packings of graphs
• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• Sparse sets in the complements of graphs with given girth

Cites work

• scientific article; zbMATH DE number 426373 (Why is no real title available?)
• scientific article; zbMATH DE number 861401 (Why is no real title available?)
• A note on embedding graphs without short cycles
• A note on packing graphs without cycles of length up to five
• Edge disjoint placement of graphs
• Embedding (p,p - 1) graphs in their complements
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement
• Fixed-point-free embeddings of graphs in their complements
• On packable digraphs
• Packings of graphs and applications to computational complexity

Cited in

(3)

• Sparse sets in the complements of graphs with given girth
• On embedding graphs with bounded sum of size and maximum degree
• Near packings of graphs

This page was built for publication: Sparse graphs of girth at least five are packable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759402)