On Ramsey $$(mK_2,H)$$(mK2,H)-Minimal Graphs
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-016-1748-1
Abstract: Let $$\mathcal {R}(G,H)$$R(G,H) denote the set of all graphs F satisfying $$F \rightarrow (G,H)$$F→(G,H) and for every $$e \in E(F),$$e∈E(F),$$(F-e) \nrightarrow (G,H).$$(F-e)↛(G,H). In this paper, we derive the necessary and sufficient conditions for graphs belonging… read more here.
Keywords: minimal graphs; graphs; mk2 minimal; mk2 ... See more keywords