Date: 2013-12-11 09:07:23Cycle double cover Petersen graph Hypohamiltonian graph Cubic graph Hamiltonian path Induced path Extremal graph theory Cycle graph Planar graph Graph theory Graph coloring Snark | | ON STABLE CYCLES AND CYCLE DOUBLE COVERS OF GRAPHS WITH LARGE CIRCUMFERENCE JONAS HÄGGLUND AND KLAS MARKSTRÖM Abstract. A cycle C in a graph is called stable if there exist no other cycle D in the same graph such that Add to Reading ListSource URL: abel.math.umu.seDownload Document from Source Website File Size: 785,96 KBShare Document on Facebook
|