Up-embeddability and independent number of simple graphs.
From MaRDI portal
Publication:4649982
zbMATH Open1265.05158MaRDI QIDQ4649982FDOQ4649982
Authors: Shengxiang Lv, Yanpei Liu 
Publication date: 15 November 2012
Recommendations
- Up-embeddability of graphs with new degree-sum of independent vertices
- Upper embeddability of 3-edge-connected simple graphs with independence number \(\leq 5\)
- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- Upper embeddability, edge independence number and girth
- Up-embeddability of graphs with small order
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (5)
- Up-embeddability of graphs with small order
- Upper embeddability of 3-edge-connected simple graphs with independence number \(\leq 5\)
- Upper embeddability, edge independence number and girth
- Up-embeddability of graphs with new degree-sum of independent vertices
- Up-embeddability of graphs with new degree-sum
This page was built for publication: Up-embeddability and independent number of simple graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649982)
