نتایج جستجو برای: perfect man

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

Journal: :Discrete Applied Mathematics 1999

Journal: :Journal of Combinatorial Theory, Series A 1994

Journal: :the journal of tehran university heart center 0
ali hosseinsabet tehran heart center, tehran university of medical sciences, tehran, iran. mahmoud shirzad tehran heart center, tehran university of medical sciences, tehran, iran. maryam sotoudeh-anvari tehran heart center, tehran university of medical sciences, tehran, iran.

a 51-year-old man was admitted to the emergency department with palpitation and atypical chest pain. he had a history of percutaneous mitral valve commissurotomy 20 years previously. he did not use any drugs. physical examination was unremarkable except for a loud s1 on auscultation. the surface electrocardiogram (ecg) showed atrial fibrillation rhythmwith rapid ventricular response and right b...

2007
Richard I. Cook Christopher Nemeth Sidney Dekker

A man tried on a suit in a clothing store. Looking at himself in the mirror, the man observed that the jacket was too long in the back. “No problem,” said the salesman. “Just bend forward a little at the waist.” The man bent forward. The back of the suit now looked fine but he now saw that the left sleeve was a little too short and the right one a little too long. “No problem,” said the salesma...

Journal: :Discrete Mathematics 2006
Stefan Hougardy

The Strong Perfect Graph Conjecture, suggested by Claude Berge in 1960, had a major impact on the development of graph theory over the last forty years. It has led to the definitions and study of many new classes of graphs for which the Strong Perfect Graph Conjecture has been verified. Powerful concepts and methods have been developed to prove the Strong Perfect Graph Conjecture for these spec...

Journal: :Discrete Mathematics 2006
Hortensia Galeana-Sánchez

In this paper we give a characterization of kernel-perfect (and of critical kernel-imperfect) arc-local tournament digraphs. As a consequence, we prove that arc-local tournament digraphs satisfy a strenghtened form of the following interesting conjecture which constitutes a bridge between kernels and perfectness in digraphs, stated by C. Berge and P. Duchet in 1982: a graph G is perfect if and ...

Journal: :Discrete Mathematics 2005
Igor E. Zverovich Vadim E. Zverovich

In this article, we present a characterization of basic graphs in terms of forbidden induced subgraphs. This class of graphs was introduced by Conforti, Cornuéjols and Vušković [3], and it plays an essential role in the announced proof of the Strong Perfect Graph Conjecture by Chudnovsky, Robertson, Seymour and Thomas [2]. Then we apply the Reducing Pseudopath Method [13] to characterize the su...

Journal: :Discrete Mathematics 2009
Haitao Cao Kejun Chen Ruizhong Wei

In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in other constructions, such as superimposed codes and perfect hash families etc. The existence of super-simple (v, 4, λ)-BIBDs have been determined for λ = 2, 3, 4 and 6. When λ = 5, the necessary conditions of such a d...

Journal: :International Journal of Mathematics and Mathematical Sciences 1985

Journal: :Journal of Number Theory 2012

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

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