期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Straight line closure for correction of congenital isolated bilateral macrostomia
1
作者 Narendra S.Mashalkar Naren Shetty 《Plastic and Aesthetic Research》 2015年第1期95-97,共3页
Congenital bilateral macrostomia is a very rare deformity of the mouth,and it is still rarer to see cases of isolated bilateral macrostomia.Although the creation of a symmetric neocommissure is imperative,this present... Congenital bilateral macrostomia is a very rare deformity of the mouth,and it is still rarer to see cases of isolated bilateral macrostomia.Although the creation of a symmetric neocommissure is imperative,this presents a technical challenge.A review of the literature for surgical solutions revealed various techniques,but no cases in which a bilateral straight line repair was described and adopted.This report presents the case of a 3-month-old boy with isolated bilateral macrostomia for whom straight line closure was performed on both sides.At 1 year follow-up,the oral commissures are symmetric with aesthetically pleasing scars and no lateral migration. 展开更多
关键词 Bilateral macrostomia muscle repair straight line closure
原文传递
Even factors with a bounded number of components in iterated line graphs
2
作者 LV ShengMei XIONG LiMing 《Science China Mathematics》 SCIE CSCD 2017年第1期177-188,共12页
We consider even factors with a bounded number of components in the n-times iterated line graphs L^n(G). We present a characterization of a simple graph G such that L^n(G) has an even factor with at most k components,... We consider even factors with a bounded number of components in the n-times iterated line graphs L^n(G). We present a characterization of a simple graph G such that L^n(G) has an even factor with at most k components, based on the existence of a certain type of subgraphs in G. Moreover, we use this result to give some upper bounds for the minimum number of components of even factors in L^n(G) and also show that the minimum number of components of even factors in L^n(G) is stable under the closure operation on a claw-free graph G, which extends some known results. Our results show that it seems to be NP-hard to determine the minimum number of components of even factors of iterated line graphs. We also propose some problems for further research. 展开更多
关键词 even factor iterated line graph branch closure claw-free graph
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部