Connected plane sets which contain no nondegenerate connected simple graph
نویسندگان
چکیده
منابع مشابه
Counting connected sets and connected partitions of a graph
This paper concerns two related enumeration problems on vertex labeled graphs. Given such a graph G, we investigate the number C(G) of connected subsets of the vertex set and the number P (G) of connected partitions of the vertex set. By connected we mean that the induced subgraphs are connected. The numbers C(G) and P (G) can be regarded as the (connected) graph analogs of the number of subset...
متن کاملLongest Cycles of a 3-Connected Graph Which Contain Four Contractible Edges
We classify all pairs (G,C) of a 3-connected graph G and a longest cycle C of G such that C contains precisely four contractible edges of G. AMS 2000 Mathematics Subject Classification. 05C40.
متن کاملConnected Treewidth and Connected Graph Searching
Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible. Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible.
متن کاملColoring intersection graphs of arc-connected sets in the plane
A family of sets in the plane is simple if the intersection of its any subfamily is arc-connected, and it is pierced by a line L if the intersection of its any member with L is a nonempty segment. It is proved that the intersection graphs of simple families of compact arc-connected sets in the plane pierced by a common line have chromatic number bounded by a function of their clique number.
متن کاملColouring Arcwise Connected Sets in the Plane II
Let G be the family of nite collections S where S is a collection of closed, bounded, arcwise connected sets in R 2 which for any S; T 2 S where S \ T 6 = ;, it holds that S \ T is arcwise connected. Given S 2 G which is triangle-free, we show that provided S is suu-ciently large there exists a subcollection S 0 S of at most 5 sets with the property that the sets of S surrounded by S 0 induce a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1991
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1991-0991696-9