41 research outputs found
Pancyclicity of Hamiltonian line graphs
Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n), the line graph L(G) of G is pancyclic whenever L(G) is hamiltonian. Results are proved showing that f(n) = ®(n 1/3)
Risk Assessment After a Severe Hospital-Acquired Infection Associated With Carbapenemase-Producing Pseudomonas aeruginosa
__Importance:__ Resistance of gram-negative bacilli to carbapenems is rapidly emerging worldwide. In 2016, the World Health Organization defined the hospital-built environment as a core component of infection prevention and control programs. The hospital-built environment has recently been reported as a source for outbreaks and sporadic transmission events of carbapenemase-producing gram-negative bacilli from the environment to patients.
__Objective:__ To assess risk after the identification of an unexpected, severe, and lethal hospital-acquired infection caused by carbapenemase-producing Pseudomonas aeruginosa in a carbapenemase-low endemic setting.
__Design, Settings, and Participants:__ A case series study in which a risk assessment was performed on all 11 patients admitted to the combined cardiothoracic surg