Brick Lane

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Brick Generation

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching decomposition procedure of Kotzig, and Lovász and Plummer. We prove that every brick except for the Petersen graph can be reduced to K4 or the prism by repeatedly applying a ce...

متن کامل

Starting from scratch and building brick by brick in comprehension.

During narrative comprehension, readers construct representations of the situation described by a text, called situation models. Theories of situation model construction and event comprehension posit two distinct types of situation model updating: incremental updating of individual situational dimensions, and global updates in which an old model is abandoned and a new one created. No research t...

متن کامل

Brick Manifolds and Toric Varieties of Brick Polytopes

In type A, Bott-Samelson varieties are posets in which ascending chains are flags of vector spaces. They come equipped with a map into the flag variety G/B. These varieties are mostly studied in the case in which the map into G/B is birational to the image. In this paper we study Bott-Samelsons for general types, more precisely, we study the combinatorics a fiber of the map into G/B when it is ...

متن کامل

Passing Lane Effectiveness on Two-Lane Roads

IN T R O D U C T IO N A passing lane is an added lane provided in one or both directions of travel on a conventional tw o-lane highw ay to im prove passing oppo r­ tunities. T his definition includes passing lanes in level or rolling terra in , clim bing lanes on grades, and short four-lane sections. T he length of the added lane can vary from 1,000 feet as m uch as 3 miles. Figure 1 illustrate...

متن کامل

Brick partitions of graphs

For each rational number q ≥ 1, we describe two partitions of the vertex set of a graph G, called the q-brick partition and the q-superbrick partition. The special cases when q = 1 are the partitions given by the connected components and the 2-edge-connected components of G, respectively. We obtain structural results on these partitions and describe their relationship to the principal partition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Islam and Society

سال: 2004

ISSN: 2690-3741,2690-3733

DOI: 10.35632/ajis.v21i3.1787