Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles

100%

Vetrík T.

Discussiones Mathematicae Graph Theory

2008

tom 28

nr 1

91-96

We derive an upper bound on the number of vertices in graphs of diameter 3 and given degree arising from Abelian lifts of dipoles with loops and multiple edges.

On Ramsey $(K_{1,2},C₄)$-minimal graphs

51%

Vetrík T., Yulianti L., Baskoro E.

Discussiones Mathematicae Graph Theory

2010

tom 30

nr 4

637-649

For graphs F, G and H, we write F → (G,H) to mean that any red-blue coloring of the edges of F contains a red copy of G or a blue copy of H. The graph F is Ramsey (G,H)-minimal if F → (G,H) but F* ↛ (G,H) for any proper subgraph F* ⊂ F. We present an infinite family of Ramsey $(K_{1,2},C₄)$-minimal graphs of any diameter ≥ 4.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Vetrík T.

1 Baskoro E.

1 Yulianti L.

1 2010

1 2008

Wyniki wyszukiwania

An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles

On Ramsey $(K_{1,2},C₄)$-minimal graphs