Please wait English Svenska Norsk.
Cite Export. Permanent link. Citation style.
Cycle double covers in cubic graphs having special structures
More styles. More languages. Output format. Create Close.
Circuit Double Cover Of Graphs Circuit Double Cover Of Graphs
Altmetric score. Each bridgeless graph G has a family of subgraphs, each admist a nowhere zero 5-flow, and their union covers each edge of G exactly twice. Double cycle cover conjecture unoriented version : Each bridgeless graph has a cycle double cover, i. G has a family of cycles, their union covers each edge exactly twice.
Double cycle cover conjecture oriented version : Each bridgeless graph has a oriented cycle double cover, i. G has a family of directed cycles, their union covers each edge exactly twice, once in each direction.
Welcome to International Press of Boston
The oriented version is due to Jaeger [Ja88]. Archdeacon, Face coloring of embedded graphs. Graph Theory, 8 , Thesis, University of Waterloo, Waterloo, Canada, Jaeger, Nowhere zero flow problems. Selected Topics in Graph Theory 3 L.
Beineke and R. Wilson eds.
From Wikipedia, the free encyclopedia
Pressmann, Sur les colorations des aretes des graphes cubiques. Seymour, Sums of circuits. Graph Theory and Related Topics J.
Related Circuit Double Cover of Graphs
Copyright 2019 - All Right Reserved