Theorem 4 Let G be a graph of n vertices, and. Then k and d can be integers such that d < mn. Proof: Suppose that By scaling if necessary, there is a m-circular colouring c that maps the vertices of G ...

E. R. Scheinerman and D. H. Ullman, “Frational Graph Theory,” John Wiley and Sons, New York, 1997. has been cited by the following article: TITLE: Multiple Circular Colouring as a Model for Scheduling ...

The graph below shows the total number of publications each year in Graph Coloring and Planar Graphs. References [1] 2-Distance Choosability of Planar Graphs with a Restriction for Maximum Degree .

A 3-coloring graph problem, one of the NP-problems, has been solved using the method of circular DNA displacement. The whole computing process is based on single circular DNA branch migrations just in ...