Some further vertex turán numbers for cube graphs

Authors

  • Harborth, Heiko
  • Nienborg, Hauke

Abstract

Partial results are obtained for the minimum number h(n, k) of vertices to be deleted from the cube graph Qn such that no subgraph Qk is complete.

Published

2008-05-09

How to Cite

Harborth, Heiko, & Nienborg, Hauke. (2008). Some further vertex turán numbers for cube graphs. Utilitas Mathematica, 75. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/565

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.