Triple placement of graphs

DOI10.1007/BF01195330zbMath0817.05034OpenAlexW11875404MaRDI QIDQ2366221

Paweł A. Wojda, Mariusz Woźniak

Publication date: 29 June 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01195330

zbMATH Keywords

3-placeable graphstriple placement

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Embedding graphs of small size ⋮ A note on packing of three forests ⋮ Packing three trees ⋮ Packing Trees into 1-planar Graphs ⋮ Embedding of graphs in two-irregular graphs ⋮ k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ Packing of graphs and permutations -- a survey ⋮ Packing a number of copies of a \(( p , q )\)-graph

Cites Work

• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Embedding (p,p - 1) graphs in their complements
• Every (p,p-2) graph is contained in its complement

This page was built for publication: Triple placement of graphs