A note on \(k\)-placeable graphs

DOI10.1016/j.disc.2011.08.002zbMath1238.05217OpenAlexW2139230717MaRDI QIDQ409394

Andrzej Żak

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-placementedge disjointpacking graph

Mathematics Subject Classification ID

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

Related Items

k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ Packing a number of copies of a \(( p , q )\)-graph

Cites Work

• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• Every (p,p-2) graph is contained in its complement
• On the packing of three graphs