Multiple vertex coverings by specified induced subgraphs

Details Multiple vertex coverings by specified induced subgraphs Multiple vertex coverings by specified induced subgraphs

1999-12-22

arxiv.org/abs/math/9912188v1

Mathematics

Combinatorics

10 pages, 3 figures

Scientific paper

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of H_i. When k=2 and one graph is an independent set of size n, we determine the optimum within a constant. When k=2 and the graphs are a star and an independent set, we determine the answer exactly.

Affiliated with

Also associated with

No associations

Rating

Multiple vertex coverings by specified induced subgraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiple vertex coverings by specified induced subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple vertex coverings by specified induced subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-519339