No label defined (Q3340889)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3873369
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3873369

      Statements

      0 references
      1984
      0 references
      Eulerian chain
      0 references
      Eulerian circuit
      0 references
      segment reversal
      0 references
      [For the entire collection see Zbl 0534.00005.] If an Eulerian circuit C visits a vertex v more than once, then one can obtain new Eulerian circuit by reversing the segment of C which lies between the two occurrences of v. \textit{J. Abraham} and \textit{A. Kotzig} [Ann. Discrete Math. 8, 65-69 (1980; Zbl 0453.05045)] showed that every Eulerian circuit for a given graph is obtainable from every other Eulerian circuit by a sequence of such reversals. In the present paper this result is rederived, and then extended to all Eulerian chains, both finite and infinite.
      0 references

      Identifiers