No label defined (Q3328557)

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

      Statements

      0 references
      1984
      0 references
      hexagonal animal
      0 references
      1-factor
      0 references
      [For the entire collection see Zbl 0521.00010.] Let \(K=S_ 1,S_ 2,...,S_ k\), k 1, be a set of hexagons of a hexagonal system (or hexagonal animal) H. If G is a graph with 2n vertices, define a 1-factor of G as a selection of n independent edges of G (covering all vertices of G). K is a cover of H if the hexagons \(S_ 1,S_ 2,...,S_ k\) are pairwise disjoint and \(H\backslash K\) has a 1- factor. The author shows, inter alia, that H has a 1-factor if and only if it has a cover and that, if H has a Hamiltonian cycle, then every hexagon of H is a cover of H. He also characterizes hexagonal systems having Hamiltonian cycles.
      0 references

      Identifiers