A note on k-placeable graphs

DOI10.1016/J.DISC.2011.08.002MaRDI QIDQ409394zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Triple placement of graphs
• Packing two copies of a tree into its third power
• Packing a number of copies of a \(( p , q )\)-graph
• Packing four copies of a tree into a complete graph
• Packing of three copies of a graph

Cites work

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

Cited in

(6)

• Packing a number of copies of a \(( p , q )\)-graph
• Note on compact packing of a graph
• Packing of three copies of a graph
• k-Planar Placement and Packing of Δ-Regular Caterpillars
• Subgraphs in vertex neighborhoods ofKr-free graphs
• Packing four copies of a tree into a complete graph

This page was built for publication: A note on \(k\)-placeable graphs

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