Sparse graphs of girth at least five are packable

DOI10.1016/J.DISC.2012.08.014zbMath1256.05186OpenAlexW2122827174MaRDI QIDQ1759402

Andrzej Żak, Agnieszka Goerlich

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)

Related Items (2)

Near packings of graphs ⋮ On embedding graphs with bounded sum of size and maximum degree

Cites Work

• Edge disjoint placement of graphs
• Embedding (p,p - 1) graphs in their complements
• Packings of graphs and applications to computational complexity
• Fixed-point-free embeddings of graphs in their complements
• A note on embedding graphs without short cycles
• 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
• On Packable Digraphs
• Unnamed Item
• Unnamed Item

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