Eun-KyungCho

Given a graph $G$, a decomposition of $G$ is a collection of spanning subgraphs $H_1,\dots ,H_t$ of $G$ such that each edge of $G$ is an edge of $H_i$ for exactly one $i\in \{1,\dots ,t\}$. Given a positive integer $d$, a graph is said to be $d$-degenerate if every subgraph of it has …

The independent domination number of a graph $G$, denoted $i(G)$, is the minimum size of an independent dominating set of $G$. In this talk, we prove a series of results regarding independent domination of graphs with bounded maximum degree. Let $G$ be a graph with maximum degree at most $k$ where $k\ge 1$. We prove that …