The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs

<p class="p1"><span>The edge-distinguishing chromatic number (EDCN) of a graph </span><span class="math inline"><em>G</em></span><span> is the minimum positive integer </span><span class="math inline"><em>k</em></span><span> such that there exists a vertex coloring </span><span class="math inline"><...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй

Үндсэн зохиолчид:	Grant Fickes, Wing Hong Tony Wong
Формат:	Artigo
Хэл сонгох:	Inglês
Хэвлэсэн:	Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2022-09-01
Цуврал:	Electronic Journal of Graph Theory and Applications
Нөхцлүүд:	vertex coloring, edge-distinguishing, graph embedding, edcn, caterpillars, petal graphs, chorded cycles, spiders
Онлайн хандалт:	http://www.ejgta.org/index.php/ejgta/article/view/1299
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!