scholarly journals All Minor-Minimal Apex Obstructions with Connectivity Two

10.37236/8382 ◽  
2021 ◽  
Vol 28 (1) ◽  
Author(s):  
Adam S. Jobson ◽  
André E. Kézdy
Keyword(s):  
Planar Graph ◽  
The Family ◽  
Apex Graphs ◽  
Apex Graph ◽  
Standing Problem

A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of determining this finite list of apex obstructions remains open. This paper determines the $133$ minor-minimal, non-apex graphs that have connectivity two.

scholarly journals A tight Erdős-Pósa function for planar minors

2019 ◽  
Author(s):  
Wouter Cames van Batenburg ◽  
Tony Huyn ◽  
Gwenaël Joret ◽  
Jean-Florent Raymond
Keyword(s):  
Planar Graph ◽  
General Theorem ◽  
Large Body ◽  
Minimum Size ◽  
Property A ◽  
Disjoint Cycles ◽  
The Family ◽  
Odd Cycle ◽  
A Minor ◽  
Odd Cycles

Let F be a family of graphs. Then for every graph G the maximum number of disjoint subgraphs of G, each isomorphic to a member of F, is at most the minimum size of a set of vertices that intersects every subgraph of G isomorphic to a member of F. We say that F packs if equality holds for every graph G. Only very few families pack. As the next best weakening we say that F has the Erdős-Pósa property if there exists a function f such that for every graph G and integer k>0 the graph G has either k disjoint subgraphs each isomorphic to a member of F or a set of at most f(k) vertices that intersects every subgraph of G isomorphic to a member of F. The name is motivated by a classical 1965 result of Erdős and Pósa stating that for every graph G and integer k>0 the graph G has either k disjoint cycles or a set of O(klogk) vertices that intersects every cycle. Thus the family of all cycles has the Erdős-Pósa property with f(k)=O(klogk). In contrast, the family of odd cycles fails to have the Erdős-Pósa property. For every integer ℓ, a sufficiently large Escher Wall has an embedding in the projective plane such that every face is even and every homotopically non-trivial closed curve intersects the graph at least ℓ times. In particular, it contains no set of ℓ vertices such that each odd cycle contains at least one them, yet it has no two disjoint odd cycles. By now there is a large body of literature proving that various families F have the Erdős-Pósa property. A very general theorem of Robertson and Seymour says that for every planar graph H the family F(H) of all graphs with a minor isomorphic to H has the Erdős-Pósa property. (When H is non-planar, F(H) does not have the Erdős-Pósa property.) The present paper proves that for every planar graph H the family F(H) has the Erdős-Pósa property with f(k)=O(klogk), which is asymptotically best possible for every graph H with at least one cycle.

scholarly journals New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree

2011 ◽  
Vol Vol. 13 no. 3 (Combinatorics) ◽  
Author(s):  
Xin Zhang ◽  
Jian-Liang Wu ◽  
Guizhen Liu
Keyword(s):  
Planar Graph ◽  
Complete Graph ◽  
Planar Graphs ◽  
Minimum Degree ◽  
Upper Bounds ◽  
The Family ◽  
International Audience

Combinatorics International audience A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is shown that each 1-planar graph of minimum degree 6 contains a copy of 4-cycle with all vertices of degree at most 19. In addition, we also show that the complete graph K 4 is light in the family of 1-planar graphs of minimum degree 7, with its height at most 11.

Triassic sponges (Sphinctozoa) from Hells Canyon, Oregon

1988 ◽  
Vol 62 (03) ◽  
pp. 419-423 ◽  
Author(s):  
Baba Senowbari-Daryan ◽  
George D. Stanley
Keyword(s):  
Endemic Species ◽  
Upper Triassic ◽  
Island Arc ◽  
Tropical Island ◽  
The Family ◽  
Wallowa Terrane ◽  
Unique Condition ◽  
Hells Canyon

Two Upper Triassic sphinctozoan sponges of the family Sebargasiidae were recovered from silicified residues collected in Hells Canyon, Oregon. These sponges areAmblysiphonellacf.A. steinmanni(Haas), known from the Tethys region, andColospongia whalenin. sp., an endemic species. The latter sponge was placed in the superfamily Porata by Seilacher (1962). The presence of well-preserved cribrate plates in this sponge, in addition to pores of the chamber walls, is a unique condition never before reported in any porate sphinctozoans. Aporate counterparts known primarily from the Triassic Alps have similar cribrate plates but lack the pores in the chamber walls. The sponges from Hells Canyon are associated with abundant bivalves and corals of marked Tethyan affinities and come from a displaced terrane known as the Wallowa Terrane. It was a tropical island arc, suspected to have paleogeographic relationships with Wrangellia; however, these sponges have not yet been found in any other Cordilleran terrane.

Electron Microscopy of Mycoplasma Pneumoniae

1971 ◽  
Vol 29 ◽  
pp. 258-259 ◽  
Author(s):  
E. S. Boatman ◽  
G. E. Kenny
Keyword(s):  
Electron Microscopy ◽  
Light Microscopy ◽  
Growth Phase ◽  
Hela Cells ◽  
Sulfonic Acid ◽  
Gamma Globulin ◽  
Horse Serum ◽  
Morphological Aspects ◽  
The Family

Information concerning the morphology and replication of organism of the family Mycoplasmataceae remains, despite over 70 years of study, highly controversial. Due to their small size observations by light microscopy have not been rewarding. Furthermore, not only are these organisms extremely pleomorphic but their morphology also changes according to growth phase. This study deals with the morphological aspects of M. pneumoniae strain 3546 in relation to growth, interaction with HeLa cells and possible mechanisms of replication.The organisms were grown aerobically at 37°C in a soy peptone yeast dialysate medium supplemented with 12% gamma-globulin free horse serum. The medium was buffered at pH 7.3 with TES [N-tris (hyroxymethyl) methyl-2-aminoethane sulfonic acid] at 10mM concentration. The inoculum, an actively growing culture, was filtered through a 0.5 μm polycarbonate “nuclepore” filter to prevent transfer of all but the smallest aggregates. Growth was assessed at specific periods by colony counts and 800 ml samples of organisms were fixed in situ with 2.5% glutaraldehyde for 3 hrs. at 4°C. Washed cells for sectioning were post-fixed in 0.8% OSO4 in veronal-acetate buffer pH 6.1 for 1 hr. at 21°C. HeLa cells were infected with a filtered inoculum of M. pneumoniae and incubated for 9 days in Leighton tubes with coverslips. The cells were then removed and processed for electron microscopy.

Exposure of protein VP7 on the surface of bluetongue virus

1990 ◽  
Vol 48 (3) ◽  
pp. 600-601
Author(s):  
A.D. Hyatt
Keyword(s):  
Bluetongue Virus ◽  
Structural Proteins ◽  
Major Constituent ◽  
Outer Coat ◽  
Virus Particles ◽  
Antibody Recognition ◽  
The Core ◽  
The Family ◽  
Electron Microscopical ◽  
Physical Accessibility

Bluetongue virus (BTV) is the type species os the genus orbivirus in the family Reoviridae. The virus has a fibrillar outer coat containing two major structural proteins VP2 and VP5 which surround an icosahedral core. The core contains two major proteins VP3 and VP7 and three minor proteins VP1, VP4 and VP6. Recent evidence has indicated that the core comprises a neucleoprotein center which is surrounded by two protein layers; VP7, a major constituent of capsomeres comprises the outer and VP3 the inner layer of the core . Antibodies to VP7 are currently used in enzyme-linked immunosorbant assays and immuno-electron microscopical (JEM) tests for the detection of BTV. The tests involve the antibody recognition of VP7 on virus particles. In an attempt to understand how complete viruses can interact with antibodies to VP7 various antibody types and methodologies were utilized to determine the physical accessibility of the core to the external environment.

Computational Micrograph Registration with Sieve Processes

1996 ◽  
Vol 54 ◽  
pp. 440-441
Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn
Keyword(s):  
Planar Graph ◽  
Efficient Algorithm ◽  
Spatial Organization ◽  
Spatial Arrangement ◽  
Stereo Image ◽  
Image Model ◽  
Geometric Invariants ◽  
Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Sign in / Sign up

Export Citation Format

Share Document