Colorable

Colorable or colourable may refer to:

  • Graph coloring in Mathematics
  • in Law, that a legal burden of proof would be met at trial

Other articles related to "colorable":

Uniquely Colorable Graph - Related Concepts - Unique Total Colorability
... A uniquely total colorable graph is a k-total-chromatic graph that has only one possible (proper) k-total-coloring up to permutation of the colors ... graphs, paths, and cycles of length divisible by 3 are uniquely total colorable graphs ... Some properties of a uniquely k-total-colorable graph G with n vertices χ″(G) = Δ(G) + 1 unless G = K2 ...
Philippine Trademark Law - Tracing Trademark History in Ascertaining Confusing Similarity
... similarity or the likelihood of confusion stems from colorable imitation, which has been defined as “such a close or ingenious imitation as to be calculated to deceive ordinary purchasers, or such ... does not normally copy out but only makes colorable changes, employing enough points of similarity to confuse the public with enough points of difference to confuse the ... Case law has evolved two kinds of tests in determining whether or not colorable imitation exists – the dominancy test and the holistic test ...
Cyclic Graph - Properties
... is Connected 2-regular Eulerian Hamiltonian 2-vertex colorable, if and only if it has an even number of vertices. 2-edge colorable, if and only if it has an even number of vertices 3-vertex colorable and 3-edge colorable, for any number of vertices A unit distance graph In addition As cycle graphs ...
Uniquely Colorable Graph - Related Concepts - Unique Edge Colorability
... A uniquely edge-colorable graph is a k-edge-chromatic graph that has only one possible (proper) k-edge-coloring up to permutation of the colors ... The only uniquely 2-edge-colorable graphs are the paths and the cycles ... For any k, the stars K1,k are uniquely k-edge-colorable graphs ...
Uniquely Colorable Graph - Examples
... A complete graph is uniquely colorable, because the only proper coloring is one that assigns each vertex a different color ... Every k-tree is uniquely (k + 1)-colorable ... The uniquely 4-colorable planar graphs are known to be exactly the Apollonian networks, that is, the planar 3-trees (Fowler 1998) ...