<abstract xmlns="http://www.w3.org/1999/xhtml"><p>The existence of edges is a huge challenge with regards to determining lucky k-polynomials of simple connected graphs in general. In this paper the lucky 3-polynomials of path and cycle graphs of order, 3 ≤ n ≤ 8 are presented as the basis for the heuristic method to determine the lucky k-polynomials for k-colorable graphs. The difficulty of adjacency with graphs is illustrated through these elementary graph structures. The results are also illustratively compared with the results for null graphs (edgeless graphs). The paper could serve as a basis for finding recurrence results through innovative methodology.</p></abstract>

The existence of edges is a huge challenge with regards to determining lucky k-polynomials of simple connected graphs in general. In this paper the lucky 3-polynomials of path and cycle graphs of order, 3 ≤ n ≤ 8 are presented as the basis for the heuristic method to determine the lucky k-polynomials for k-colorable graphs. The difficulty of adjacency with graphs is illustrated through these elementary graph structures. The results are also illustratively compared with the results for null graphs (edgeless graphs). The paper could serve as a basis for finding recurrence results through innovative methodology.

Heuristic method to determine lucky k-polynomials for k-colorable graphs

Acta Universitatis Sapientiae, Informatica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"Heuristic method to determine lucky k-polynomials for k-colorable graphs"}

The existence of edges is a huge challenge with regards to determining lucky k-polynomials of simple connected graphs in general. In this paper the lucky...

Heuristic method to determine lucky k-polynomials for k-colorable graphs

Data publikacji: 21 sty 2020

Zakres stron: 206 - 214

Otrzymano: 18 paź 2019

DOI: https://doi.org/10.2478/ausi-2019-0014

Słowa kluczowe
chromatic completion, perfect lucky 3-coloring, lucky 3-polynomial

© 2019 Johan Kok, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Heuristic method to determine lucky k-polynomials for k-colorable graphs

Data publikacji: 21 sty 2020

Zakres stron: 206 - 214

Otrzymano: 18 paź 2019

DOI: https://doi.org/10.2478/ausi-2019-0014

Słowa kluczowechromatic completion, perfect lucky 3-coloring, lucky 3-polynomial

© 2019 Johan Kok, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Słowa kluczowe
chromatic completion, perfect lucky 3-coloring, lucky 3-polynomial