In this chapter, we consider the existence of PC C 4 's in edge-colored graphs. We establish sharp color neighborhood union conditions for the existence of PC C 4 's in edge-colored complete graphs and complete bipartite graphs, respectively.
In this chapter, we consider the existence of PC C 4 's in edge-colored graphs. We establish sharp color neighborhood union conditions for the existence of PC C 4 's in edge-colored complete graphs and complete bipartite graphs, respectively.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.