Edge-disjoint circuits in graphs on the torus

A. Frank, A. Schrijver

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We give necessary and sufficient conditions for a given graph embedded on the torus, to contain edge-disjoint cycles of prescribed homotopies (under the assumption of a "parity" condition).

Original languageEnglish
Pages (from-to)9-17
Number of pages9
JournalJournal of Combinatorial Theory, Series B
Volume55
Issue number1
DOIs
Publication statusPublished - May 1992

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this