On cycles through specified vertices

13 years 4 months ago

Download www.tu-chemnitz.de

For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35

Tobias Gerlach, Frank Göring, Jochen Harant,

Real-time Traffic

AMS Classification | DM 2006 | Local Connectedness |

claim paper

» Cycles passing through k 1 vertices in kconnected graphs

» On the number of factorizations of a full cycle

» On 3regular 4ordered graphs

» Finding shortest contractible and shortest separating cycles in embedded graphs

» Annular embeddings of permutations for arbitrary genus

» 3D direct vertical interconnect microprocessors test vehicle

» On low degree kordered graphs

» Middleware Vertical Handoff Manager A Neural NetworkBased Solution

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DM
Authors	Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác

Comments (0)

Sciweavers

On cycles through specified vertices

AMS Classification | DM 2006 | Local Connectedness |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers