نتایج جستجو برای: linebreak circle

تعداد نتایج: 23887  

Journal: :Chemical & Engineering News Archive 1971

Journal: :Journal of Evolutionary Economics 2014

Journal: :Caribbean Quilt 1969

2009
Flavia Bonomo Guillermo Durán Luciano N. Grippo Martín Darío Safe

A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P4-t...

2011
ALEXANDR V. KOSTOCHKA KEVIN G. MILANS

A circle graph is the intersection graph of chords drawn in a circle. The best known general upper bound on the chromatic number of circle graphs with clique number k is 50 · 2. We prove a stronger bound of 2k − 1 for graphs in a simpler subclass of circle graphs, so called clean graphs. Based on this result we prove that the chromatic number of every circle graph with clique number at most 3 i...

2002
NICHOLAS J. DARAS

The main purpose of this paper is to consider an explicit form of the Padé-type operators. To do so, we consider the representation of Padétype approximants to the Fourier series of the harmonic functions in the open disk and of the L-functions on the circle by means of integral formulas, and, then we define the corresponding Padé-type operators. We are also concerned with the properties of the...

2008
Michael Kapovich

We consider Gromov–Thurston examples of negatively curved nmanifolds which do not admit metrics of constant sectional curvature. We show that for each n ≥ 4 some of the Gromov–Thurston manifolds admit strictly convex real–projective structures.

Journal: :CoRR 2017
Zoltán Kovács

A curve, also shown in introductory maths textbooks, seems like a circle. But it is actually a different curve. This paper discusses some easy approaches to classify the result, including a GeoGebra applet construction.

1995
Tomasz Dubejko TOMASZ DUBEJKO

A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some applications. In particular, we obtain a short proof of a result regarding the type problem for circle packings, which shows that the type of a circle packing is closely related to the type of its tangency graph.

2007
Gennadiy Averkov

Using notions of Minkowski geometry (i.e., of the geometry of finite dimensional Banach spaces) we find new characterizations of centrally symmetric convex bodies, equiframed curves, bodies of constant width and certain convex bodies with modified constant width property. In particular, we show that straightforward extensions of some properties of bodies of constant Euclidean width are also val...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید