Abstract:
Purpose: Research on entrepreneurial intention has been built almost entirely on people who have not yet established their ventures. This study asks what sustains the intention of founders who already operate young ventures and develops a framework linking that intention to new venture development and sustai...
Monika Gupta, V. Sharma, N. Rajput· Exploresearch· 0 citations
A strong odd $k$-coloring of a graph $G$ is a proper $k$-coloring such that every color appearing in the neighborhood of a non-isolated vertex appears an odd number of times. The minimum $k$ for which $G$ admits a strong odd $k$-coloring is the \emph{strong odd chromatic number}, denoted by $\chi_{\text{so}}(G)$, of $G...
It is proved that PCF-COLORABILITY is NP-complete for bipartite graphs, and linear-time algorithms for PCF-COLORABILITY are provided in block graphs, proper interval graphs, chain graphs, and pseudo-split graphs.
D. Pradhan, V. Sharma· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.