首页|SUPEREULERIAN GRAPHS AND THE PETERSEN GRAPH

SUPEREULERIAN GRAPHS AND THE PETERSEN GRAPH

扫码查看
原文链接
  • NSTL
Any 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph. (C) 1996 Academic Press, Inc. [References: 20]

10 verticesCycle

Catlin PA.、Lai HJ.

展开 >

WAYNE STATE UNIV DEPT MATH DETROIT MI 48202 USA

1996

Journal of Combinatorial Theory

Journal of Combinatorial Theory

ISSN：0095-8956
年,卷(期)：1996.66(1)