期刊论文详细信息
AKCE International Journal of Graphs and Combinatorics
On Ramsey -minimal graphs
Hilda Assiyatun1  Kristiana Wijaya1  Djoko Suprijanto1  Edy Tri Baskoro1 
[1] Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung (ITB)Jalan Ganesa 10, Bandung 40132;
关键词: ramsey minimal graph;    edge coloring;    matching;    path;   
DOI  :  10.1016/j.akcej.2017.08.003
来源: DOAJ
【 摘 要 】

Let and be simple graphs. We write to mean that any red–blue coloring of all edges of will contain either a red copy of or a blue copy of A graph (without isolated vertices) satisfying and for each is called a Ramsey -minimal graph. The set of all Ramsey -minimal graphs is denoted by In this paper, we derive the necessary and sufficient condition of graphs belonging to for any connected graph Moreover, we give a relation between Ramsey - and -minimal graphs, and Ramsey - and -minimal graphs. Furthermore, we determine all graphs in

【 授权许可】

Unknown   

  文献评价指标  
  下载次数:0次 浏览次数:0次