Author:
Cockayne E. J.,Lorimer P. J.
Abstract
Any term or symbol undefined in this paper is defined in [5]. For graphs F and G, G > F means G contains a subgraph isomorphic to F and E(G) denotes the edge set of G. If E ⊆ E(G), 〈E〉 is the subgraph of G whose edge set is E and whose vertex set is that subset of vertices of G which are incident with edges in E.
Publisher
Canadian Mathematical Society
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Ramsey Numbers of Stripes Versus Trees and Unicyclic Graphs;Journal of the Operations Research Society of China;2023-06-15
2. Star-Critical Ramsey Numbers Involving Various Graphs;Star-Critical Ramsey Numbers for Graphs;2023
3. Class Ramsey Numbers Involving Induced Graphs;Algorithmic Aspects in Information and Management;2022
4. Some Multi-Color Ramsey Numbers on Stars versus Path, Cycle or Wheel;Graphs and Combinatorics;2020-02-22
5. Maximum Subgraphs in Ramsey Graphs;Algorithmic Aspects in Information and Management;2020