Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...
Project for the FINP course at UL FMF. We want to find a planar subcubic graph with the packing coloring number as large as possible. We implement an ILP model to determine the packing coloring number ...
Solving the general planar graph colouring problem using Grover's Algorithm. The backtracking algorithm takes O(k^n) for k colours and n vertices while Grover's reduces this complexity to O(sqrt(k^n)) ...
Abstract: Given a graph G = (V, E), a coloring of a graph consists in assigning a color to any vertex of the graph, such that any pair of neighboring vertices receives different colors. Finding the ...
ABSTRACT: The Total Coloring Conjecture (TCC) proposes that every simple graph G is (Δ + 2)-totally-colorable, where Δ is the maximum degree of G. For planar graph, TCC is open only in case Δ = 6. In ...
ABSTRACT: The Total Coloring Conjecture (TCC) proposes that every simple graph G is (Δ + 2)-totally-colorable, where Δ is the maximum degree of G. For planar graph, TCC is open only in case Δ = 6. In ...
Abstract: In this paper, we propose a novel non-hybrid discrete firefly algorithm (DFA) for solving planar graph coloring problems. The original FA handles continuous optimization problems only. To ...
Let G be a graph and k a natural number. A k-coloring of G is a map c that maps the vertices of G into the set {1, 2, ..., k} (whose elements are called colors) such that no two adjacent vertices are ...
A graph is planar if it can be drawn in the plane in such a way that no edges intersect, except of course at a common endvertex. Planar graphs corresponding to the regular polyhedra and other ...
Unele rezultate au fost ascunse, deoarece pot fi inaccesibile pentru dvs.
Afișați rezultatele inaccesibile