Cycle double cover
id:
cycle-double-cover-164-11028320
title:
Cycle double cover
text:
In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly twice. For instance, for any polyhedral graph, the faces of a convex polyhedron that represents the graph provide a double cover of the graph: each edge belongs to exactly two faces. It is an unsolved problem, posed by W. T. Tutte, Itai and Rodeh, George Szekeres and Paul Seymour and known as the cycle double cover conjecture, whether every br
brand slug:
wiki
category slug:
encyclopedia
description:
Cycles in a graph that cover each edge twice
original url:
https://en.wikipedia.org/wiki/Cycle_double_cover
date created:
2009-02-11T02:14:01Z
date modified:
2024-08-29T00:38:19Z
main entity:
{"identifier":"Q5198159","url":"https://www.wikidata.org/entity/Q5198159"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/4d/Petersen_double_cover.svg","width":533,"height":511}
fields total:
13
integrity:
16