All trees are 1-embeddable and all except stars are 2-embeddable

DOI10.1016/0012-365X(93)90585-HzbMath0791.05078MaRDI QIDQ687137

C. R. J. Clapham, John Sheehan

Publication date: 28 June 1994

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

zbMATH Keywords

embeddingpackingtrees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Embedding (p,p - 1) graphs in their complements
• A General Criterion for the Existence of Transversals
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: All trees are 1-embeddable and all except stars are 2-embeddable