The complete list of Ramsey $(2K_2,K_4)$-minimal graphs

The complete list of Ramsey $(2K_2,K_4)$-minimal graphs

Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F$ induced by all blue edges contains a graph $H.$ A gr...

Full description

Bibliographic Details
Main Authors: Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2015-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
ramsey minimal graph, red-blue coloring, complete graph
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/157

Internet

https://www.ejgta.org/index.php/ejgta/article/view/157

Similar Items