No label defined (Q4726285)

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

      Statements

      0 references
      1985
      0 references
      binding number
      0 references
      Cartesian product
      0 references
      Hallian graph
      0 references
      [For the entire collection see Zbl 0579.00002.] A graph is G Hallian if its vertex set can be covered by a system of pairwise vertex-disjoint edges or odd cycles. G is k-Hallian if \(\forall A\subset V\) with \(| A| \leq k\), \(<V-A>\) is Hallian. Using a property of k-Hallian graphs due to Borowiecki (a related reference is given as [\textit{M. Arczymski, M. Borowiecki} and \textit{M. M. Sysło}, On Hallian digraphs, permanents and transversals, Colloq. Math. 41, 141-145 (1979; Zbl 0418.05002)]) the author outlines a proof of the following result and presents three other similar results. For \(m\geq 3\) and \(n\geq 3\) \(bind(C_ m\times C_ n)=1\) if m and n are even, and \(bind(C_ m\times C_ n)=(mn-1)/(mn-4)\) otherwise.
      0 references

      Identifiers