A note on coverings of plane graphs
Copyright policy )A note on coverings of plane graphs
AbstractFor any plane graph G the number of edges in a minimum edge covering of the faces of G is at most the vertex independence number of G and the numbre of vertices in a minimum vertex covering of the faces of G is at most the edge independence number of G. © 1995 John Wiley & Sons, Inc.
independent set, plane graph, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), matching, cover, independence number, Planar graphs; geometric and topological aspects of graph theory
independent set, plane graph, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), matching, cover, independence number, Planar graphs; geometric and topological aspects of graph theory
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!