Local Optimization of Colorings of Graphs - Anisirnov - 1986A.V. Anisimov, "Local Optimization of Colorings of Graphs," Cyber- netics, Vol. 22, No. 6, pp. 683-692, 1986.Local Optimization of Colorings of Graphs - Anisimov - 1986 () Citation Context ...al solutions to the problem ...
Tuza, Local k-colorings of graphs and hypergraphs, J. Combin. Theory Ser. B 43, 127-139, 1987.Gyárfás, A., Lehel, J., Nešetril, J., Rödl, V., Schelp, R.H., Tuza, Z.: Local k -colorings of graphs and hypergraphs. J. Combin. Theory Ser. B 43 , 127–139 (1987)...
In particular, if Knr has an edge coloring such that each vertex is incident to edges of at most s colors and every monochromatic class of edges forms a k-vertex-colorable hypergraph, then n≤ (r − 1) ks. Both bounds are sharp....
like animals and plants.The blowhole is the most difficult part to make,for the size of the blowhole makes a difference to the sound.While coloring,you can use traditional cultural elements(元素) that carry good meanings.It's hard to make taiping nijiaojiao.But when you fina...
Local rainbow coloringsdoi:10.4310/JOC.2011.V2.N2.A6Noga AlonIdo Ben-EliezerInternational Press of Boston
A local ( H, k )-coloring of K n is a coloring of its edges in which each of its subgraphs isomorphic to H is colored by at most k colors. A necessary condition on H (conjectured to be sufficient) is found such that each local ( H, k )-coloring is a k -coloring. Further...
Then the exact value of chi(l) (G) for some special graphs G such as the cartesian product of cycles, paths and complete graphs is determined.Omoomi, BPourmiri, AArs Combinatoria: An Australian-Canadian Journal of CombinatoricsB. Omoomi, A. Pourmiri, On the local colorings of graphs, ...
Also, using an argument similar to one of Erdos, we show that our algorithm can compute k-list vertex colorings of graphs having girth larger than clog_(k-1)n.Flavio ChierichettiAndrea VattaniAutomata, Languages and Programming: 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July...
Fixing a graph G and a positive integer m, let f(m, G) denote the smallest n such that every m-good edge-coloring of Kn yields a properly edge-colored copy of G, and let g(m, G) denote the smallest n such that every m-good edge-coloring of Kn yields a rainbow copy of G. ...
q-ary Hamming graph?We study eigenfunctions and perfect colorings of the n-dimensional q-ary Hamming graph. We obtain the formulae of interdependence of local distributions for an eigenfunction in two orthogonal faces. We prove an analogous result for perfect colorings.Anastasia Vasil’eva...