8 problems

Full-degree vertex necessity conjecture. If

Let $P_k$ be the path on $k$ vertices, let $K_s$ be the complete graph on $s$ vertices, and let $sat(n,H)$ denote the minimum number of edges in an $H$-saturated graph on $n$ verti…

Local antimagic chromatic number conjecture.

Let $G$ be a simple graph. Write $\chi=\chi(G)$ for its chromatic number and $\Delta=\Delta(G)$ for its maximum degree. For graphs $G_1$ and $G_2$, let $G_1\lor G_2$ denote their j…

Let $P_n$ be the path on $n$ vertices, let $mP_n$ denote the disjoint union of $m$ copies of $P_n$, let $K_1$ be a single vertex, and let $\chi_{la}(G)$ denote the local antimagic…

Let $G$ and $H$ be graphs such that $q(G)=q(H)=2$, with $MB(G)=k_1$ and $MB(H)=k_2$, and suppose that the quantities denoted in the source by $\mrr+(G)$ and $\mrr+(H)$ satisfy…

Let $P_m$ and $P_n$ be paths on $m+1$ and $n+1$ vertices, respectively, and let $P_m+P_n$ denote their graph join. The minimum coprime number $\mathfrak{pr}(G)$ is the least $M$ fo…

Let $G$ be a graph with $n$ vertices, let $\overline G$ be its complement, and let $K_1$ denote the one-vertex complete graph. The join of graphs is denoted by $\vee$, and a graph…