Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Clinical rheumatology 6 (1987), S. 597-599 
    ISSN: 1434-9949
    Schlagwort(e): Multiple Myeloma ; Osteonecrosis ; Spine ; Radiotherapy ; Vacuum Phenomenon
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Medizin
    Notizen: Summary Authors report one case of intravertebral vacuum phenomenon associated with a multiple myeloma. Initially, there occurred a collapse and a lysis of the L4 vertebral body. Two months later, after chemotherapy and cobalt-therapy, X-ray examination showed a vacuum cleft phenomenon within the body of L4 and a backward displacement of the L4 posterior wall. At the same time the patient complained of a cruralgia. Recovery occurred after decompression surgery. Histologic sampling of the L4 vertebral body revealed bone necrosis without any abnormal plasmocytosis. Authors draw attention to the neurological complications occurring in the course of the vertebral necrosis and to the fact that, even in case of multiple myeloma, the occurrence of a transverse vacuum cleft may result from osteonecrosis.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Combinatorica 8 (1988), S. 217-234 
    ISSN: 1439-6912
    Schlagwort(e): 05 B 35 ; 05 c 20 ; 68 Q 20
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract LetG be a 2-connected rooted graph of rankr andA, B two (rooted) spanning trees ofG We show that the maximum number of exchanges of leaves that can be required to transformA intoB isr 2−r+1 (r〉0). This answers a question by L. Lovász. There is a natural reformulation of this problem in the theory ofgreedoids, which asks for the maximum diameter of the basis graph of a 2-connected branching greedcid of rankr. Greedoids are finite accessible set systems satisfying the matroid exchange axiom. Their theory provides both language and conceptual framework for the proof. However, it is shown that for general 2-connected greedoids (not necessarily constructed from branchings in rooted graphs) the maximum diameter is 2r−1.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...