graph 2-colouring problem
Colouring of plane graphs with unique maximal colours on faces
... in graph theory was sparked by the problem of four colours posed by Francis Guthrie in ...the problem was resolved by Appel and Haken [1] and the conjectured statement became known as the Four Colour ...
11
Colouring of Finite Sets and Colouring of Edges of Finite Graphs
... in graph theory tointroduce new method for colouring edges and vertices of ...the graph and second related to ...of colouring) and prove some results related to this concept, and we introduce ...
13
The complexity of the empire colouring problem for linear forests
... the problem coincides with the classical vertex colouring problem on planar graphs and an (s, 1)-colouring is just a proper vertex colouring of the the host ...≥ 2 was defined by ...
17
Sorts of Colour Classes and Sorts of Families of Disjoint Sets
... of colouring of families of disjoint sets technique as a topic of set ...in graph theory to introduce new method for colouring edges and vertices of ...the graph and second related to ...of ...
8
A grouping hyper heuristic framework: application on graph colouring
... for graph colouring ...solve graph colouring ...for graph colouring, namely Lowest Index Max Crossover (LIMX), Greedy Partition Crossover Lowest In- dex (GPX-LI) and Greedy ...
26
A Tabu Search based University Lectures Timetable Scheduling Model
... UCTTP problem as: n: the number of events E={e1, e2, ...( 2) classrooms and (3) ...UCTTP problem includes: (1) Operational Researches (OR) based techniques including graph colouring ...
8
The Complexity of the Empire Colouring Problem
... ing problem (as defined by Percy Heawood in 1890) for maps containing em- pires formed by exactly r > 1 countries ...the problem can be solved in polynomial time using s colours on maps whose underlying ...
23
Trivial Colouring and Non-Trivial Colouring for Graph’s Edges
... of colouring of families of disjoint sets technique as a topic of set ...in graph theory to introduce new method for colouring edges and vertices of ...the graph and second related to ...of ...
11
Trivial Colouring and Non-Trivial Colouring for Graph’s Vertices
... of colouring of families of disjoint sets technique as a topic of set ...in graph theory to introduce new method for colouring edges and vertices of ...the graph and second related to ...of ...
13
Topics in graph colouring and graph structures
... any graph on n vertices containing o(n 3 ) triangles can be made triangle-free by the removal of o(n 2 ) ...a problem in fractional ...given graph can be viewed as a integer programming ...
292
A Simple Ant Colony Optimization Algorithm to Select Cluster Heads in Ad Hoc Networks
... suggested graph colouring algorithm is a new ACO-based algorithm; this algorithm can be copied to solve multi-objective optimization problems in cluster formation by defining multi-heuristic functions, ...
10
Mixing homomorphisms, recolorings, and extending circular precolorings
... For general graph theory terminology and notation, we follow [6]. We con- sider finite undirected graphs without multiple edges. We are mainly interested in loop-free graphs, with the exception of Section 3 where ...
30
Multiple Circular Colouring as a Model for Scheduling
... Conclusion We proved that for a large class of graphs, this multiple circular colouring and m-circular chromatic number of the conflict graph will provide better solutions for the schedu[r] ...
5
Computation of Chromatic Numbers for New Class of Graphs and its Applications
... radio colouring idea is applied in the field of radio ...radio colouring problem, the transmitters which are at distance two are assigned different ...interference graph provides a minimum ...
5
Complexity of greedy edge-colouring
... − 2 } is not assigned to any edge incident to ...− 2 appear on three edges inci- dents to ...− 2 < β , the edge-colouring c is not ...
7
Breaking the symmetry of the graph colouring problem with genetic algorithms
... Genetic algorithms (GAs) have been successfully applied to a variety of domains but the performance of the core technique (i.e. with swap/flip mutations and one point/uniform crossover) on the VGCP is quite poor unless ...
6
Colouring Benjamin
... from its dream about itself’ (456). In a way one could say that Benjamin’s Arcades Project is devoted to rendering revolutionary possibilities conceivable through its attempt to foster a dialectical consciousness. The ...
11
On the partition monoid and some related semigroups
... In [7] we made a more detailed study of the range of the function (a; b) and used the results to determine the ideal structure of the Kau¤man monoid and two of its quotient monoids. We rephrase here some of these ...
6
Complexity separating classes for edge-colouring and total-colouring
... Observe, additionally, that the class of square-free unichord-free graphs is a separating class for edge-colouring and total-colouring problems. While the class is not the first separating class for ...
5
Colouring of Graphs Using Colouring of Families of Disjoint Sets Technique
... v 2 , v 3 ,..., v w be w vertices each with degree of colouring n , there are many locals maximum different colours at w , where 3 w 2 n 1 and there are many local minimum different colours at ...
11