Independence, induced subgraphs, and domination in $K_{1,r}$-free graphs

Documents similaires

• Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
  par: Caro, Yair, et autres
  Publié: (2024)
• Maximum $k$-colourable induced subgraphs in $(P_5+rK_1)$-free graphs
  par: Henderson, Cicely, et autres
  Publié: (2024)
• Lower bounds for the total (distance) $k$-domination number of a graph
  par: Davila, Randy
  Publié: (2024)
• Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
  par: Gishboliner, Lior, et autres
  Publié: (2024)
• Another conjecture of TxGraffiti concerning zero forcing and domination in graphs
  par: Davila, Randy R.
  Publié: (2024)