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

First Page		Document Content
Date: 2013-12-11 09:07:23 Cycle 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 List Source URL: abel.math.umu.se Download Document from Source Website File Size: 785,96 KB Share Document on Facebook

	A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a DocID: 1ra7T - View Document
	DOUGLAS BAUER Professor Mathematical Sciences Department Stevens Institute of Technology EDUCATION Ph.D., Stevens Institute of Technology, 1978 DocID: 1qndD - View Document
	Natural Models for Evolution on Networks George B. Mertzios1 , Sotiris Nikoletseas2, Christoforos Raptopoulos2 , and Paul G. Spirakis2 1 School of Engineering and Computing Sciences, Durham University, UK DocID: 1qhOL - View Document
	Natural Models for Evolution on Networks∗ George B. Mertzios† Sotiris Nikoletseas‡ Christoforos Raptopoulos§ DocID: 1q2jO - View Document
	On the Tur´an number of forests Bernard Lidick´ y ∗ DocID: 1pnHO - View Document