Indexed by：
Abstract：
Chvátal and Thomassen (J. Combinatorial Theory Ser. B 24 (1978) 61-75) proved that, given a 2-edge-connected graph G., the problem of deciding whether G has an orientation of diameter 2 is NP-complete. In this note we show that this problem, if restricted to planar graphs, becomes simple. We show that only two planar graphs admit a strong orientation of diameter 2: the 3-cycle and the octahedron.
Keyword：
Reprint 's Address：
Email：
Source ：
Utilitas Mathematica
ISSN： 0315-3681
Year： 2009
Volume： 79
Page： 71-80
0 . 5 8 9
JCR@2009
0 . 2 7 9
JCR@2020
JCR Journal Grade：4
CAS Journal Grade：1
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
