On Unicyclic Ramsey (mK2, P3)−Minimal Graphs

Kristiana Wijaya; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto

doi:10.1016/j.procs.2015.12.067

ScienceGate Book Chapters

JOURNAL ARTICLE

On Unicyclic Ramsey (mK2, P3)−Minimal Graphs

Kristiana Wijaya Edy Tri Baskoro Hilda Assiyatun Djoko Suprijanto

Year: 2015 Journal: Procedia Computer Science Vol: 74 Pages: 10-14 Publisher: Elsevier BV

DOI: 10.1016/j.procs.2015.12.067

Get Full-Text PDF Get Analytical Report

Abstract

Abstract Ramsey minimal graph is one of growing topics in Ramsey theory. The search of Ramsey minimal graphs for a combination of graphs G and H is an interesting and difficult problem. In this paper, we study the properties of Ramsey minimal graphs for G = mK2 and H = Pn. In particular, we determine all unicyclic Ramsey minimal graphs for this combination.

Keywords:

Computer science Combinatorics Ramsey's theorem Ramsey theory Graph Discrete mathematics Theoretical computer science Mathematics

Metrics

Cited By

0.66

FWCI (Field Weighted Citation Impact)

Refs

0.73

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Topology and Set Theory

Physical Sciences → Mathematics → Geometry and Topology

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

On Unicyclic Ramsey (mK2, P3)−Minimal Graphs

Abstract

Metrics

Citation History

Topics

Related Documents

Two infinite classes of unicyclic Ramsey (P3, P4) – Minimal graphs

On Ramsey (4K2,P3)-minimal graphs

On Ramsey (P3, P6)-minimal graphs

On Ramsey (3K2,P3)-minimal graphs

On Ramsey (P3, C6)-minimal graphs