Back to Results
First PageMeta Content
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

Document Date: 2013-12-11 09:07:23

Open Document

File Size: 785,96 KB

Share Result on Facebook

City

Prague / Amsterdam / New York / /

Company

Marcel Dekker Inc. / CDCC / /

Country

Netherlands / /

/

Facility

University of Waterloo / Short stable / STABLE CYCLES AND CYCLE DOUBLE COVERS OF GRAPHS WITH LARGE CIRCUMFERENCE / Umeå University / /

IndustryTerm

computer search / /

Organization

C V / ?‘O Department of Mathematics and Mathematical Statistics / University of Waterloo / Umeå University / /

Person

Tommy R. Jensen / Luis Armando Goddyn / Roland Häggkvist / Sean McGuinness / Enrique García Moreno Esteva / KLAS MARKSTRÖM / Herbert Fleischner / Michael Tarsi / Rufus Isaacs / Gunnar Brinkmann / Quan Zhang / JONAS HÄGGLUND / Andreas Huck / François Jaeger / Martin Kochol / Brendan McKay / Jan Goedgebeur / Cun-Quan Zhang / /

/

Position

Professor / /

ProgrammingLanguage

C / /

ProvinceOrState

British Columbia / New York / /

Technology

html / /

URL

http /

SocialTag