ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 32(2) (2012)
Faculty of Mathematics, Computer Science and Econometrics University of Zielona Góra Z. Szafrana 4a, Zielona Góra, Poland
We present a technique which allows to generate infinite family of
(G, H)-minimal graphs if we know some
In particular, we show how to receive infinite family of (K1, 2, Kn)-minimal graphs, for every n ≥ 3.
Keywords: Ramsey minimal graph, edge coloring, 1-factor, complete graph
2010 Mathematics Subject Classification: 05C55, 05C70, 05C76, 05D10.
Received 13 October 2010 Revised 20 June 2011 Accepted 20 June 2011