Abstract
AbstractRamsey problems are examined for the different varieties of graphs and digraphs, with and without loops and multiple edges, and even for networks. In every case, the resulting Ramsey number either fails to exist, or has a trivial value, or equals the value for the underlying graph or digraph. Thus it appears there are no new interesting Ramsey numbers for multigraphs and networks.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
