#TITLE_ALTERNATIVE#
Let F, G dan H be graphs. The notation F ! (G;H) means that any red-blue <br /> <br /> <br /> <br /> <br /> coloring of the edges of F contains a red subgraph G or a blue subgraph H. Graph <br /> <br /> <br /> <br /> <br /...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/18563 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:18563 |
|---|---|
| spelling |
id-itb.:185632017-09-27T11:43:12Z#TITLE_ALTERNATIVE# GUNAWAN , GUNTUR Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/18563 Let F, G dan H be graphs. The notation F ! (G;H) means that any red-blue <br /> <br /> <br /> <br /> <br /> coloring of the edges of F contains a red subgraph G or a blue subgraph H. Graph <br /> <br /> <br /> <br /> <br /> F is called a Ramsey (G;H)minimal graph if it satisfies that F ! (G;H) and <br /> <br /> <br /> <br /> <br /> F fie9(G;H) for any e 2 E(F). The notation Â(G;H) is the class of all Ramsey <br /> <br /> <br /> <br /> <br /> (G;H)minimal graph. In this Final Project we derive some necessary conditions <br /> <br /> <br /> <br /> <br /> of graphs belong to Â(P3;P5). From these conditions, we determine some graphs <br /> <br /> <br /> <br /> <br /> containing a cycle which belong to Â(P3;P5). text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
Let F, G dan H be graphs. The notation F ! (G;H) means that any red-blue <br />
<br />
<br />
<br />
<br />
coloring of the edges of F contains a red subgraph G or a blue subgraph H. Graph <br />
<br />
<br />
<br />
<br />
F is called a Ramsey (G;H)minimal graph if it satisfies that F ! (G;H) and <br />
<br />
<br />
<br />
<br />
F fie9(G;H) for any e 2 E(F). The notation Â(G;H) is the class of all Ramsey <br />
<br />
<br />
<br />
<br />
(G;H)minimal graph. In this Final Project we derive some necessary conditions <br />
<br />
<br />
<br />
<br />
of graphs belong to Â(P3;P5). From these conditions, we determine some graphs <br />
<br />
<br />
<br />
<br />
containing a cycle which belong to Â(P3;P5). |
| format |
Final Project |
| author |
GUNAWAN , GUNTUR |
| spellingShingle |
GUNAWAN , GUNTUR #TITLE_ALTERNATIVE# |
| author_facet |
GUNAWAN , GUNTUR |
| author_sort |
GUNAWAN , GUNTUR |
| title |
#TITLE_ALTERNATIVE# |
| title_short |
#TITLE_ALTERNATIVE# |
| title_full |
#TITLE_ALTERNATIVE# |
| title_fullStr |
#TITLE_ALTERNATIVE# |
| title_full_unstemmed |
#TITLE_ALTERNATIVE# |
| title_sort |
#title_alternative# |
| url |
https://digilib.itb.ac.id/gdl/view/18563 |
| _version_ |
1820745919035867136 |