×

On the vertex-independence number and star decomposition of graphs. (English) Zbl 0623.05031

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.

MSC:

05C35 Extremal problems in graph theory
05C10 Planar graphs; geometric and topological aspects of graph theory
05C05 Trees
PDF BibTeX XML Cite