Searching for ""Anticonnectivity" A Challenge for Structure-Property-Activity Studies." – sorted by Relevance.
-
(ANTI-)CONNECTIVITY
- of these types of movements give rise to the connectivity effects. (2a-b) illustrate the anti-connectivity of A
- Add To MetaCart
-
Cleaning for Bergeness
- ), with the following property: if C is a shortest odd hole in G, and every major vertex has at least four neighbours
- Cited by 3 (0 self) – Add To MetaCart
-
Berge trigraphs
- ] and had become known as the Strong Perfect Graph Conjecture.) To show that, we proved a structure theorem
- Cited by 2 (1 self) – Add To MetaCart
-
The strong perfect graph theorem
- of the largest clique of H. The study of perfect graphs was initiated by Claude Berge, partly motivated by a
- Cited by 69 (9 self) – Add To MetaCart
-
unknown title
- , and not the uninteresting ones. 2 A nice way to do this is Berge's definition [1]; we make the property hereditary. Let us
- Add To MetaCart
-
Partial Characterizations of Circular-Arc Graphs
- , which gives a structural property for all non-basic minimally non-CA graphs, can be deduced from Theorem
- Add To MetaCart
-
Even pairs in Berge graphs
- anticonnected set T ⊆ V (G) such that N(T ) is not a clique. Choose T maximal with this property. Throughout
- Cited by 1 (0 self) – Add To MetaCart
-
Progress on Perfect Graphs
- they introduced and studied a new parameter, called the imperfection ratio. There are several equivalent
- Cited by 3 (3 self) – Add To MetaCart
-
Excluding induced subgraphs
- ). In 1961 Claude Berge conjectured that being perfect is equivalent to the property of being F-free for a
- Add To MetaCart
-
unknown title
- define 1 that next. A subset X ` V (G) is anticonnected if the subgraph of G induced on X is connected
- Add To MetaCart

