Title of article :
Supereulerian Graphs and the Petersen Graph
Author/Authors :
Catlin، نويسنده , , Paul A. and Lai، نويسنده , , Hong-Jian، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Abstract :
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.
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
