论文信息 - On path lengths modulo three

On path lengths modulo three

We show that between any two nodes of a cubic, planar, three-connected graph there are three paths whose lengths are 0, 1, and 2 modulo 3, respectively. The proof is by a rather extensive case analysis. Counterexamples show that all three hypotheses (i.e., planarity, degree-three, and three-connectivity) are necessary.

Xiaotie Deng | Christos H. Papadimitriou | C. Papadimitriou | Xiaotie Deng

[1] Tait. 10. Remarks on the previous Communication , 1880 .

[2] Christos H. Papadimitriou,et al. The even-path problem for graphs and digraphs , 1984, Networks.

[3] W. T. Tutte. On Hamiltonian Circuits , 1946 .