نتایج جستجو برای: caterpillar.

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

Journal: :Archives of otolaryngology--head & neck surgery 1999
D Lee R D Pitetti M L Casselbrant

OBJECTIVE To describe previously unreported oropharyngeal manifestations and management of caterpillar ingestion. DESIGN Retrospective case series. SETTING Tertiary children's hospital. PATIENTS A total of 733 cases of exposure to caterpillars from January 1, 1994, to November 1, 1997, were reviewed. Twenty-six patients had oropharyngeal exposure with 8 patients ingesting the caterpillar....

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2015
Thomas John Hossie John Skelhorn Jesse W Breinholt Akito Y Kawahara Thomas N Sherratt

Many caterpillars have conspicuous eye-like markings, called eyespots. Despite recent work demonstrating the efficacy of eyespots in deterring predator attack, a fundamental question remains: Given their protective benefits, why have eyespots not evolved in more caterpillars? Using a phylogenetically controlled analysis of hawkmoth caterpillars, we show that eyespots are associated with large b...

Journal: :Discrete Mathematics 2003
Robert E. Jamison Fred R. McMorris Henry Martyn Mulder

A connected graph G is caterpillar-pure if each spanning tree of G is a caterpillar. The caterpillar-pure graphs are fully characterized. Loosely speaking they are strings or necklaces of so-called pearls, except for a number of small exceptional cases. An upper bound for the number of edges in terms of the order is given for caterpillar-pure graphs, and those which attain the upper bound are c...

2011
JIANXI LI

A caterpillar unicyclic graph is a unicyclic graph in which the removal of all pendant vertices makes it a cycle. In this paper, the unique caterpillar unicyclic graph with minimum algebraic connectivity among all caterpillar unicyclic graphs is determined.

Journal: :Discrete Mathematics 1973
Frank Harary Allen J. Schwenk

A caterpillar is a tree which metamorphoses into a path when its cocoon of endpoInt\ is removed. The number of nonisomorphic caterpillars with n + 4 points is 2n + 2 [n/21 . This neat formula is proved in two ways: first, as a special caoe of an application of Pblya’s enumerration theorem which counts graphs with integer-weightell points; secondly, 3y an appropriate labeling of the lines of the...

Journal: :Current Biology 2015
David P. Hughes

A new study reveals that an apparent mutualism between lycaenid caterpillars and their attendant ants may not be all it seems, as the caterpillars produce secretions that modify the brains and behavior of their attendant ants.

Journal: :The Journal of Cell Biology 2004
William A. Wells

Caterpillar compaction NA compaction, say Ryan Case, YunPei Chang, Nicholas Cozzarelli, Carlos Bustamante, and colleagues (University of California, Berkeley, CA), may work via a cooperative caterpillar-like mechanism. The caterpillar is formed by multiple copies of condensin protein—in this case MukBEF—with each V-shaped condensin contributing two legs. Compaction occurs when the caterpillar’s...

Journal: :The Journal of Cell Biology 2004
William A. Wells

Caterpillar compaction NA compaction, say Ryan Case, YunPei Chang, Nicholas Cozzarelli, Carlos Bustamante, and colleagues (University of California, Berkeley, CA), may work via a cooperative caterpillar-like mechanism. The caterpillar is formed by multiple copies of condensin protein—in this case MukBEF—with each V-shaped condensin contributing two legs. Compaction occurs when the caterpillar’s...

Journal: :Discrete Applied Mathematics 2012
Carmen Ortiz Mónica Villanueva

A caterpillar graph is a tree in which the removal of all pendant vertices results in a chordless path. In this work, we determine the number of maximal independent sets (mis) in caterpillar graphs. For a general graph, this problem is #P—complete. We provide a polynomial time algorithm to generate the whole family of mis in a caterpillar graph. We also characterize the independent graph (inter...

1999
Anne Brüggemann-Klein Derick Wood

We present a novel, yet simple, technique for the speciication of context in struc-tured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciication for structured documents, as we shall demonstrate, and for the speciication of ...

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

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