Hall numbers of some complete k-partite graphs

Authors

  • Allagan, Julian A.

Abstract

The Hall number is a graph parameter closely related to the choice number. Here it is shown that the Hall numbers of the complete multipartite graphs K(m,2,...,2), m ≥ 2, are equal to their choice numbers.

Published

2012-09-09

How to Cite

Allagan, Julian A. (2012). Hall numbers of some complete k-partite graphs. Utilitas Mathematica, 89. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/835

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.