On Ramsey (<em>mK</em>₂,<em>bP</em>_n)-minimal Graphs

<p style="text-align: justify;">Let <em>G</em> and <em>H</em> be two given graphs. The notation <em>F</em>→(<em>G,H</em>) means that any red-blue coloring on the edges of <em>F</em> will create either a red subgraph <em>G</em> or a blue subgraph <em>H</em> in <em>F</em>. A graph <em>F</em> is a Rams...

全面介紹

書目詳細資料

Principais autores:	Nadia Nadia, Lyra Yulianti, Fawwaz Fakhrurrozi Hadiputra
格式:	Artigo
語言:	Inglês
出版:	InaCombS; Universitas Jember; dan Universitas Indonesia 2023-07-01
叢編:	Indonesian Journal of Combinatorics
主題:	path graphs matchings ramsey minimal graphs
在線閱讀:	http://www.ijc.or.id/index.php/ijc/article/view/181
標簽:	添加標簽 沒有標簽, 成為第一個標記此記錄!