A note on packing graphs without cycles of length up to five
From MaRDI portal
Publication:2380220
zbMath1186.05096MaRDI QIDQ2380220
Andrzej Żak, Agnieszka Goerlich
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/228911
Related Items (3)
Near packings of graphs ⋮ Sparse graphs of girth at least five are packable ⋮ On embedding graphs with bounded sum of size and maximum degree
This page was built for publication: A note on packing graphs without cycles of length up to five
