Hamiltonian coloring, named after William Rowan Hamilton, is a type of graph coloring. Hamiltonian coloring uses a concept called detour distance between...

In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph...

edge coloring of a graph by the colors red, blue, and green. Edge colorings are one of several different types of graph coloring. The edge-coloring problem...

The Petersen graph has a Hamiltonian path but no Hamiltonian cycle. It is the smallest bridgeless cubic graph with no Hamiltonian cycle. It is hypohamiltonian...

more accurate the simulation. If the Hamiltonian is represented as a Sparse matrix, the distributed edge coloring algorithm can be used to decompose it...

Goldberg–Seymour conjecture Graph coloring game Graph two-coloring Harmonious coloring Incidence coloring List coloring List edge-coloring Perfect graph Ramsey's...

problem of finding 3-edge-colorings of bridgeless cubic planar graphs. In a Hamiltonian cubic planar graph, such an edge coloring is easy to find: use two...

conjecture, states that every bicubic polyhedral graph is Hamiltonian. When a cubic graph is Hamiltonian, LCF notation allows it to be represented concisely...

colorable graph is a k-chromatic graph that has only one possible (proper) k-coloring up to permutation of the colors. Equivalently, there is only one way to...

Hadwiger number is never less than the chromatic number. Hamiltonian A Hamiltonian path or Hamiltonian cycle is a simple spanning path or simple spanning cycle:...