The degree-sum of adjacent vertices, girth and upper embeddability
From MaRDI portal
Publication:5397294
Recommendations
- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- Up-embeddability of graphs with new degree-sum of independent vertices
- Up-embeddability via girth and the degree-sum of adjacent vertices
- A sufficient condition on upper embeddability of graphs
- Up-embeddability of graphs with new degree-sum
Cited in
(8)- Up-embeddability via girth and the degree-sum of adjacent vertices
- scientific article; zbMATH DE number 1559169 (Why is no real title available?)
- Upper embeddability of graphs, independence number, and the degree sum of nonadjacent vertices
- Maximum genus, degree of vertex and girth
- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- Upper embeddability, edge independence number and girth
- Upper embeddable graphs via the degree-sum of adjacent vertices.
- Upper embeddability of graphs and vertex degree in a cycle
This page was built for publication: The degree-sum of adjacent vertices, girth and upper embeddability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397294)