scientific article; zbMATH DE number 4010553

MaRDI QIDQ3760574zbMATH OpenFDO

Authors Yair Caro, Yehuda Roditty

Publication date 1985

zbMATH Keywords

bipartite subgraphgenusplanar graphsstar-decompositionvertex-independence number

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35)

Recommendations

• Bounds on the independence number of a graph in terms of order, size and maximum degree
• Bounds on the number of vertex independent sets in a graph
• The critical independence number and an independence decomposition
• Lower bounds for constant degree independent sets
• Decomposing a planar graph into an independent set and a 3-degenerate graph

Cited in

(16)

• On certain spanning subgraphs of embeddings with applications to domination
• The Colin de Verdière number and sphere representations of a graph
• A probabilistic lower bound on the independence number of graphs
• New probabilistic upper bounds on the domination number of a graph
• General bounds on rainbow domination numbers
• Domination in graphs of minimum degree five
• Smaller embeddings of partial \(k\)-star decompositions
• Rainbow domination in graphs
• An upper bound for domination number of 5-regular graphs
• scientific article; zbMATH DE number 1501958 (Why is no real title available?)
• A note on bounds for the broadcast domination number of graphs
• On the d-independence number in 1-planar graphs
• On the independence number of 1-planar graphs
• New probabilistic upper bounds on the domination number of a graph. II
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Domination in bipartite graphs

This page was built for publication:

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