Bounded complete embedding graphs

MaRDI QIDQ2799800zbMATH OpenFDO

Authors Jennifer K. Aust, D. G. Hoffman

Publication date 13 April 2016

Published in Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

small embeddings of graph designs

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• scientific article; zbMATH DE number 3857140
• Bounded Embeddings of Graphs in the Plane
• Embeddings of graphs of fixed treewidth and bounded degree
• Regular embeddings of complete bipartite graphs
• Bounded graphs
• scientific article; zbMATH DE number 951476
• Edge-transitive embeddings of complete graphs
• Upper embeddability of graphs
• scientific article; zbMATH DE number 4160754
• On embedding complete graphs into hypercubes

Cited in

(7)

• Bounded graphs
• Bound graph polysemy
• Bundled Crossings in Embedded Graphs
• Bounded Embeddings of Graphs in the Plane
• scientific article; zbMATH DE number 4160754 (Why is no real title available?)
• Embedding arbitrary finite simple graphs into small strongly regular graphs
• Sampling complete designs

This page was built for publication: Bounded complete embedding graphs

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