No label defined (Q3760577)

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 4010556
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4010556

      Statements

      1986
      0 references
      4-regular graph
      0 references
      circuit
      0 references
      4-regular plane graph
      0 references
      0 references
      0 references
      [For the entire collection see Zbl 0608.00004.] A circuit is a minimal closed walk. A plane graph is a graph embedded in the plane and a straight-ahead walk in a 4-regular plane graph is a walk that leaves each internal vertex of the walk along the edge opposite to the edge upon which the walk enters the internal vertex. A *-circuit is a circuit that is also a straight-ahead walk. Let \(X_ n\) denote the class of 4-regular plane graphs having n vertices and a straight-ahead Euler tour. Set \(C_ n=\{k\); some \(G\in X_ n\) has exactly \(k^*\)- circuits\}. The paper completely determines \(C_ n:\) \(C_ n=\{k;\;2\leq k\leq n\}\), if n is even, \(C_ n=\{k;\;2\leq k\leq n\}\cup \{k;\;n<k\leq 2n\), k even, \(k\neq 2n-2\},\) if n is odd.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references