Caro, Y.; Roditty, Y. On the vertex-independence number and star decomposition of graphs. (English) Zbl 0623.05031 Ars Comb. 20, 167-180 (1985). There have been found bounds for the vertex-independence number, in terms of the maximal number of edges in any bipartite subgraph of G, and of the minimum degree of vertices of G. These results are used to determine star-decomposition of graphs based also on its genus, and in particular of planar graphs. Cited in 1 ReviewCited in 9 Documents MathOverflow Questions: Bound on graph domination number when min degree is 7 MSC: 05C35 Extremal problems in graph theory 05C10 Planar graphs; geometric and topological aspects of graph theory 05C05 Trees Keywords:vertex-independence number; bipartite subgraph; star-decomposition; genus; planar graphs PDF BibTeX XML Cite \textit{Y. Caro} and \textit{Y. Roditty}, Ars Comb. 20, 167--180 (1985; Zbl 0623.05031) OpenURL