A note on the upper embeddability of graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4012641
- Upper embeddability of graphs
- A sufficient condition on upper embeddability of graphs
- scientific article; zbMATH DE number 1500196
- Upper embeddable graphs with respect to diameter
- Upper embeddable graphs with respect to A-partition on vertices
- A note on uniquely embeddable graphs
- Upper embeddability of graphs and vertex degree in a cycle
- scientific article; zbMATH DE number 2058671
- Some new classes of upper embeddable graphs.
Cited in
(8)- Note on upper bound graphs and forbidden subposets
- scientific article; zbMATH DE number 3845605 (Why is no real title available?)
- Upper-embeddability of a graph G^3
- scientific article; zbMATH DE number 5630901 (Why is no real title available?)
- scientific article; zbMATH DE number 60528 (Why is no real title available?)
- scientific article; zbMATH DE number 846937 (Why is no real title available?)
- scientific article; zbMATH DE number 907923 (Why is no real title available?)
- scientific article; zbMATH DE number 5260312 (Why is no real title available?)
This page was built for publication: A note on the upper embeddability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5017786)