Upper embeddability of 3-edge-connected simple graphs with independence number 5

zbMATH Open1107.05029MaRDI QIDQ3415693FDOQ3415693

Authors: Yanbo Gao, Han Ren 

Publication date: 19 January 2007

Recommendations

• Upper embeddability, edge independence number and girth
• Up-embeddability and independent number of simple graphs.
• scientific article; zbMATH DE number 5630901
• Upper embeddability, girth and the degree-sum of nonadjacent vertices
• A sufficient condition on upper embeddability of graphs

zbMATH Keywords

maximum genusupper embeddableBetti deficiency

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)

Cited In (2)

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

This page was built for publication: Upper embeddability of 3-edge-connected simple graphs with independence number \(\leq 5\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415693)