Upper embeddability of graphs, independence number, and the degree sum of nonadjacent vertices
From MaRDI portal
Publication:5452792
zbMATH Open1155.05318MaRDI QIDQ5452792FDOQ5452792
Authors: Zhangdong Ouyang, Yuanqiu Huang, Qi-Ming Zhang
Publication date: 4 April 2008
Recommendations
- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- The vertice degree condition on upper embeddability of graphs
- Upper embeddability of 3-edge-connected simple graphs with independence number \(\leq 5\)
- The degree-sum of adjacent vertices, girth and upper embeddability
- Up-embeddability of graphs with new degree-sum of independent vertices
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (2)
This page was built for publication: Upper embeddability of graphs, independence number, and the degree sum of nonadjacent vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452792)