14532 research outputs found
Sort by
湛水構造物のひび割れ制御設計の効率化に向けた連続RC壁の温度ひび割れ挙動解析
Get PDF横浜国立大学博士（工学）Doctor of Philosophy in EngineeringThe full text of this thesis is available for viewing at the Central Library upon request by 5:00 p.m. on weekdays.この学位論文の全文は、中央図書館で平日17時までに申請することで閲覧が可能です
下水汚泥灰を用いたアルカリ活性材料の性能： 圧縮強度および耐硫酸性
Get PDF横浜国立大学博士（工学）Doctor of Philosophy in EngineeringThe full text of this thesis is available for viewing at the Central Library upon request by 5:00 p.m. on weekdays.この学位論文の全文は、中央図書館で平日17時までに申請することで閲覧が可能です
バイオマス系灰を用いて改質した粘土の物理力学的特性
Get PDF横浜国立大学博士（工学）Doctor of Philosophy in EngineeringThe full text of this thesis is available for viewing at the Central Library upon request by 5:00 p.m. on weekdays.この学位論文の全文は、中央図書館で平日17時までに申請することで閲覧が可能です
<Article>Evaluating Marketing Success: The Integration of Objective Metrics and Subjective Perspectives
Get PDFDevelopment of a Surgical Drill with Penetration Detection Scheme based on Thrust Force
Get PDF横浜国立大学博士（工学）Doctor of Engineerin
Spanning 3-trees of 3-connected graphs on closed surfaces
No full textNakamoto, Oda and Ota [3-trees with few vertices of degree 3 in circuit graphs, Discrete Math. 309 (2009), 666–672] proved that every 3-connected planar graph with n vertices has a spanning 3-tree with at most max{0, n−7 3} vertices of degree 3. This result was proved for a wider class of graphs, called the circuit graphs, and the result for circuit graphs is best possible for the pseudoradial graph of triangulations (PRTs). In this paper, we prove that only PRTs attain the bound, and consequently, we improve the bound for 3-connected planar graphs. Our result is a successor of our previous result on the size of 2-connected spanning subgraphs of circuit graphs and 3-connected planar graphs, but we extend our arguments on the two topics to 3-connected graphs on the projective plane
