A sufficient condition on upper embeddability of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1270473 (Why is no real title available?)
- A class of upper-embeddable graphs
- A new characterization of the maximum genus of a graph
- Bounds of the number of disjoint spanning trees
- Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
- How to determine the maximum genus of a graph
- Maximum genus and chromatic number of graphs
- Maximum genus and maximum nonseparating independent set of a 3-regular graph
- On the maximum genus of a graph
- The maximum genus of graphs of diameter two
- Upper embeddability of graphs, independence number, and the degree sum of nonadjacent vertices
Cited in
(16)- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- Upper embeddability, edge independence number and girth
- scientific article; zbMATH DE number 1559169 (Why is no real title available?)
- scientific article; zbMATH DE number 5260312 (Why is no real title available?)
- Locally connectivity and up-embeddability of a graph
- Upper embeddability of 3-edge-connected simple graphs with independence number \(\leq 5\)
- Vertex splitting and upper embeddable graphs
- scientific article; zbMATH DE number 3933119 (Why is no real title available?)
- Upper embeddability of graphs and vertex degree in a cycle
- scientific article; zbMATH DE number 60528 (Why is no real title available?)
- A note on the upper embeddability of graphs
- Up-embeddability of a graph by order and girth
- Upper embeddable graphs with respect to diameter
- Up-embeddability of graphs with new degree-sum of independent vertices
- The degree-sum of adjacent vertices, girth and upper embeddability
- The vertice degree condition on upper embeddability of graphs
This page was built for publication: A sufficient 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 Q989758)
