Upper embeddability of graphs, independence number, and the degree sum of nonadjacent vertices

MaRDI QIDQ5452792zbMATH OpenFDO

Authors Zhangdong Ouyang, Yuanqiu Huang, Qi-Ming Zhang

Publication date 4 April 2008

zbMATH Keywords

graphindependence numberupper embeddabilityBetti deficiency number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)

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

Cited in

(2)

• Up-embeddability via girth and the degree-sum of adjacent vertices
• A sufficient condition on upper embeddability of graphs

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)