000002847 001__ 2847
000002847 005__ 20141118153417.0
000002847 04107 $$acze
000002847 046__ $$k2008-12-04
000002847 100__ $$aBaskoro, E.
000002847 24500 $$aA Note on Ramsey (K<sub>1, 2</sub>, C<sub>4</sub>) - Minimal Graphs of Diameter 2

000002847 24630 $$n1.$$p70 Years of FCE STU - Proceedings of the International Scientific Conference
000002847 260__ $$bSlovak University of Technology in Bratislava, Faculty of Civil Engineering, 2008 
000002847 506__ $$arestricted
000002847 520__ $$2eng$$aFor graphs F , G and H, we write F → (G, H) to mean that if the edges of F are colored with two colors, say red and blue, then the red subgraph contains a copy of G or the blue subgraph contains a copy of H. The graph F is (G, H)-minimal (Ramsey-minimal) if F → (G, H) but F ∗ (G, H) for any proper subgraph F ∗ ⊂ F . We present new Ramsey (K1,2 , C4 )−minimal graphs of diameter 2.

000002847 540__ $$aText je chráněný podle autorského zákona č. 121/2000 Sb.
000002847 653__ $$aRamsey-minimal graph, diameter of a graph, coloring

000002847 7112_ $$aInternational Scientific Conference 70 Years of FCE STU$$cBratislava (SK)$$d2008-12-04 / 2008-12-05$$gHMC13
000002847 720__ $$aBaskoro, E.$$iYulianti, L.$$iVetrík, T.
000002847 8560_ $$ffischerc@itam.cas.cz
000002847 8564_ $$s112384$$uhttp://invenio.itam.cas.cz/record/2847/files/05_A_Baskoro_Vetrik_Yulianti.pdf$$y
             Original version of the author's contribution as presented on CD, .
            
000002847 962__ $$r2540
000002847 980__ $$aPAPER