Summary: An independent coalition in a graph \(G\) consists of two disjoint, independent vertex sets \(V_1\) and \(V_2\), such that neither \(V_1\) nor \(V_2\) is a dominating set, but the union \(V_1\cup V_2\) is an independent dominating set of \(G\). An independent coalition partition of \(G\) is a partition \(\{V_1, \ldots, V_k\}\) of \(V(G)\) such that for every \(i\in [k]\), either the set \(V_i\) consists of a single dominating vertex of \(G\), or \(V_i\) forms an independent coalition with some other part \(V_j\). The independent coalition number \(\operatorname{IC}(G)\) of \(G\) is the maximum order of an independent coalition of \(G\). The independent coalition graph \(\mathrm{ICG}(G,\pi)\) of \(\pi=\{V_1, \ldots, V_k\} \) (and of \(G)\) has the vertex set \(\{V_1,\ldots, V_k\} \), vertices \(V_i\) and \(V_j\) being adjacent if \(V_i\) and \(V_j\) form an independent coalition in \(G\). In this paper, a large family of graphs with \(\operatorname{IC}(G) = 0\) is described and graphs \(G\) with \(\operatorname{IC}(G)\in \{n(G), n(G)-1\}\) are characterized. Some properties of \(\mathrm{ICG}(G,\pi)\) are presented. The independent coalition graphs of paths are characterized, and the independent coalition graphs of cycles described.