First Page | Document Content | |
---|---|---|
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 thatAdd to Reading ListSource URL: abel.math.umu.seDownload Document from Source WebsiteFile Size: 785,96 KBShare Document on Facebook |
Near-Optimal Compression for the Planar Graph Metric Amir Abboud∗ Paweł Gawrychowski† AbstractDocID: 1vkO7 - View Document | |
Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa)DocID: 1v2rQ - View Document | |
UNDER REVIEW, Gracker: A Graph-based Planar Object Tracker Tao Wang and Haibin LingDocID: 1uoNh - View Document | |
The random planar graph process Stefanie Gerke ∗ Dirk SchlatterDocID: 1tk3p - View Document | |
Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights ReservedDocID: 1rtvU - View Document |