Embedding graphs of small size

DOI10.1016/0166-218X(94)90112-0zbMath0807.05025MaRDI QIDQ1329826

Mariusz Woźniak

Publication date: 31 July 1994

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

zbMATH Keywords

embeddingpacking

Mathematics Subject Classification ID

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

Related Items (7)

Embedding digraphs of small size ⋮ Packing three trees ⋮ Fixed-point-free embeddings of digraphs with small size ⋮ Labeled embedding of \((n, n-2)\)-graphs in their complements ⋮ Packing of graphs and permutations -- a survey ⋮ On self-complementary supergraphs of (\(n,n\))-graphs ⋮ The complete graph \(t\)-packings and \(t\)-coverings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Fixed-point-free embeddings of graphs in their complements
• Mutual placement of bipartite graphs
• Packing of graphs - a survey
• Triple placement of graphs
• Selbstkomplementäre Graphen
• On self‐complementation
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement

This page was built for publication: Embedding graphs of small size