We prove that if two graphs of girth at least 6 have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of girth at least 7. We also make a remark on reconstruction of graphs from their higher powers.

Kostochka, A.V., List edge chromatic number of graphs with large girth, Discrete Mathematics 101 (1992) 189-201. It is shown that the list edge chromatic number of any graph with maximal degree A and girth at least 8A(ln A + 1.1) is equal to A + 1 or to A.

He, Hou, Lih, Shao, Wang, and Zhu showed that a planar graph of girth 11 can be decomposed into a forest and a matching. Borodin, Kostochka, Sheikh, and Yu improved the bound on girth to 9. We give sufficient conditions for a planar graph with 3-cycles to be decomposable into a forest and a matching. c © 2008 Elsevier B.V. All rights reserved.

Suzuki (2004) classified thin weakly distance-regular digraphs and proposed the project to classify weakly distance-regular digraphs of valency 3. The case of girth 2 was classified by the third author (2004) under the assumption of the commutativity. In this paper, we continue this project and classify these digraphs with girth more than 2 and two types of arcs.

We consider 2-homogeneous graphs, introduced by Nomura [J. Combin. Theory ser. B 60 (1994)], and discuss the elementary properties. Moreover, the diameter of 2-homogeneous graphs with even girth is bounded, and some restrictions of 2-homogeneous graphs with odd girth are obtained.

BACKGROUND Studies have shown that abdominal girth and vertebral column length have high predictive value for spinal spread after administering a dose of plain bupivacaine. we designed a study to identify the specific correlations between abdominal girth, vertebral column length and a 0.5% dosage of plain bupivacaine, which should provide a minimum upper block level (T12) and a suitable upper b...