نتایج جستجو برای: 3 dimensional characterization

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

Journal: :Discrete Mathematics 1997
Vassilis Giakoumakis

In this paper we investigate the closure ~-* under substitution-composition of a family of graphs ~,, defined by a set Lr of forbidden configurations. We first prove that ~-* can be defined by a set L~* of forbidden subgraphs. Next, using a counterexample we show that ~* is not necessarily a finite set, even when .~ is finite. We then give a sufficient condition for ~* to be finite and a simple...

Journal: :Mathematical Social Sciences 2014
Oliver Walker

Logical structures for modeling agents’ reasoning about unawareness are presented where it can hold simultaneously that: (i) agents’ beliefs about whether they are fully aware need not be veracious with partitional information; and (ii) the agent is fully aware if and only if she is aware of a fixed domain of formulae. In light of (ii), all states are deemed “possible”. Semantics operate in two...

2015
Yohann Benchetrit Henning Bruhn

We characterise t-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is h-perfect if and only if it is perfect.

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...

2015
Michael Albert Robert Brignall

In this note, we prove that all 2× 2 monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain 2× 2 having two monotone cells in the same row.

2016
Shuang-Tao Feng Yun-Hui Mei Gang Chen Xin Li Guo-Quan Lu

Sintering of nanosilver paste has been extensively studied as a lead-free die-attach solution for bonding semiconductor power chips, such as the power insulated gated bipolar transistor (IGBT). However, for the traditional method of bonding IGBT chips, an external pressure of a few MPa is reported necessary for the sintering time of ~1 h. In order to shorten the processing duration time, we dev...

2015
Lidia Montero Miguel Herrero Elena Ibáñez Alejandro Cifuentes

1 SEPARATION AND CHARACTERIZATION OF PHLOROTANNINS FROM 1 BROWN ALGAE Cystoseira abies-marina BY COMPREHENSIVE TWO2 DIMENSIONAL LIQUID CHROMATOGRAPHY. 3 Lidia Montero, Miguel Herrero*, Elena Ibáñez, Alejandro Cifuentes 4 Laboratory of Foodomics, Institute of Food Science Research (CIAL, CSIC), Nicolas 5 Cabrera 9, Campus de Cantoblanco, 28049 Madrid, Spain. 6 7 8 Abbreviations: D1, first dimens...

2011
Ling-Ju Hung Ton Kloks Fernando Sánchez Villaamil

Let k be a natural number. We introduce k-threshold graphs. We show that there exists anO(n) algorithm for the recognition of k-threshold graphs for each natural number k. k-Threshold graphs are characterized by a finite collection of forbidden induced subgraphs. For the case k = 2 we characterize the partitioned 2threshold graphs by forbidden induced subgraphs. We introduce restricted, and spe...

2014
Mahesh Mani Kevin W Lyons SK Gupta

Additive manufacturing (AM) has the potential to create geometrically complex parts that require a high degree of customization, using less material and producing less waste. Recent studies have shown that AM can be an economically viable option for use by the industry, yet there are some inherent challenges associated with AM for wider acceptance. The lack of standards in AM impedes its use fo...

Journal: :Discussiones Mathematicae Graph Theory 2004
Igor E. Zverovich Olga I. Zverovich

We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.

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

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