The vertice degree condition on upper embeddability of graphs
From MaRDI portal
Recommendations
Cited in
(13)- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- Upper embeddable graphs via the degree-sum of adjacent vertices.
- A note on the neighbor condition for up-embeddability of graphs.
- Classes of upper-embeddable graphs in terms of dominate vertices set
- Upper embeddable graphs with respect to diameter
- scientific article; zbMATH DE number 1506661 (Why is no real title available?)
- scientific article; zbMATH DE number 1559169 (Why is no real title available?)
- scientific article; zbMATH DE number 907923 (Why is no real title available?)
- Vertex splitting and upper embeddable graphs
- Upper embeddability of graphs and vertex degree in a cycle
- Upper embeddability of graphs, independence number, and the degree sum of nonadjacent vertices
- scientific article; zbMATH DE number 5260312 (Why is no real title available?)
- A sufficient condition on upper embeddability of graphs
This page was built for publication: The vertice degree condition on upper embeddability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3054095)