Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Yash Keerti"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 820-825 (2020)
A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v
Externí odkaz:
https://doaj.org/article/e56527a2899f493d896069703b0497a9
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 820-825 (2020)
A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45b7c2090682be46cc33d1bba9b055c1
https://doaj.org/article/e56527a2899f493d896069703b0497a9
https://doaj.org/article/e56527a2899f493d896069703b0497a9