A note on uniquely embeddable graphs

DOI10.7151/DMGT.1060MaRDI QIDQ4222377zbMATH OpenOpenAlexFDO

Authors Mariusz Woźniak

Publication date 5 July 1999

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4b6802ecd26b166e615e1670df7c60e2a71a091a

zbMATH Keywords

embedding

Mathematics Subject Classification ID

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

Recommendations

• Embedding graphs of small size
• Packing two graphs of order n having total size at most 2n-2
• On cyclically embeddable (n,n)-graphs
• Packing of graphs and permutations -- a survey
• On cyclically embeddable \((n,n-1)\)-graphs
• Packing of graphs and permutations
• scientific article; zbMATH DE number 125501
• Graph labellings in Boolean lattices
• On cyclically embeddable graphs
• Fixed-point-free embeddings of digraphs with small size

Cited in

(12)

• A note on similar edges and edge-unique line graphs
• Embedding graphs of small size
• On embedding graphs with bounded sum of size and maximum degree
• Graphs have unique quotient hyperspace \(\mathcal{C}_1^n(X)\)
• A note on uniquely embeddable forests
• scientific article; zbMATH DE number 426373 (Why is no real title available?)
• Unique and faithful embeddings of projective-planar graphs
• scientific article; zbMATH DE number 125501 (Why is no real title available?)
• A note on the upper embeddability of graphs
• A note on uniquely embeddable 2-factors
• On uniqueness of packing of three copies of 2-factors
• All trees are 1-embeddable and all except stars are 2-embeddable

This page was built for publication: A note on uniquely embeddable graphs

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