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...
Tallennettuna:
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2015-10-01
|
| Sarja: | Electronic Journal of Graph Theory and Applications |
| Aiheet: | |
| Linkit: | http://www.ejgta.org/index.php/ejgta/article/view/157 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|