z-logo
Premium
All triangle‐graph ramsey numbers for connected graphs of order six
Author(s) -
Faudree R. J.,
Rousseau C. C.,
Schelp R. H.
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040307
Subject(s) - ramsey's theorem , combinatorics , mathematics , graph , triangle free graph , discrete mathematics , order (exchange) , 1 planar graph , chordal graph , business , finance
The Ramsey numbers r(K 3′ G ) are determined for all connected graphs G of order six.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom