Se connecter

Bibliographies thématiques / Colouring / Articles de revues

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Colouring.

Articles de revues sur le sujet « Colouring »

Auteur : Grafiati

Publié le 4 juin 2021

Mis à jour le 26 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Colouring ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

LEHNER, FLORIAN. "Random Colourings and Automorphism Breaking in Locally Finite Graphs." Combinatorics, Probability and Computing 22, no. 6 (2013): 885–909. http://dx.doi.org/10.1017/s0963548313000382.

Texte intégral

Résumé :

A colouring of a graphGis called distinguishing if its stabilizer in AutGis trivial. It has been conjectured that, if every automorphism of a locally finite graph moves infinitely many vertices, then there is a distinguishing 2-colouring. We study properties of random 2-colourings of locally finite graphs and show that the stabilizer of such a colouring is almost surely nowhere dense in AutGand a null set with respect to the Haar measure on the automorphism group. We also investigate random 2-colourings in several classes of locally finite graphs where the existence of a distinguishing 2-colou

Styles APA, Harvard, Vancouver, ISO, etc.

2

SINGH, SHIVANI, and YULIYA ZELENYUK. "ALTERNATING COLOURINGS OF THE VERTICES OF A REGULAR POLYGON." Bulletin of the Australian Mathematical Society 100, no. 2 (2019): 177–81. http://dx.doi.org/10.1017/s0004972719000157.

Texte intégral

Résumé :

Let $n,r,k\in \mathbb{N}$. An $r$-colouring of the vertices of a regular $n$-gon is any mapping $\unicode[STIX]{x1D712}:\mathbb{Z}_{n}\rightarrow \{1,2,\ldots ,r\}$. Two colourings are equivalent if one of them can be obtained from another by a rotation of the polygon. An $r$-ary necklace of length $n$ is an equivalence class of $r$-colourings of $\mathbb{Z}_{n}$. We say that a colouring is $k$-alternating if all $k$ consecutive vertices have pairwise distinct colours. We compute the smallest number $r$ for which there exists a $k$-alternating $r$-colouring of $\mathbb{Z}_{n}$ and we count, fo

Styles APA, Harvard, Vancouver, ISO, etc.

3

Voloshin, V. "A note on the conditional chromatic polynomial." Glasgow Mathematical Journal 36, no. 3 (1994): 265–67. http://dx.doi.org/10.1017/s0017089500030834.

Texte intégral

Résumé :

In this note we consider a finite graph without loops and multiple edges. The colouring of a graph G in λ colours is the colouring of its vertices in such a way that no two of adjacent vertices have the same colours and the number of used colours does not exceed λ [1, 4]. Two colourings of graph G are called different if there exists at least one vertex which changes colour when passing from one colouring to another.

Styles APA, Harvard, Vancouver, ISO, etc.

4

Tarnai, Tibor, and András Lengyel. "The Truncated Icosahedron as an Inflatable Ball." Periodica Polytechnica Architecture 49, no. 2 (2018): 99–108. http://dx.doi.org/10.3311/ppar.12375.

Texte intégral

Résumé :

In the late 1930s, an inflatable truncated icosahedral beach-ball was made such that its hexagonal faces were coloured with five different colours. This ball was an unnoticed invention. It appeared more than twenty years earlier than the first truncated icosahedral soccer ball. In connection with the colouring of this beach-ball, the present paper investigates the following problem: How many colourings of the dodecahedron with five colours exist such that all vertices of each face are coloured differently? The paper shows that four ways of colouring exist and refers to other colouring problems

Styles APA, Harvard, Vancouver, ISO, etc.

5

Moody, R. V., and J. Patera. "Colourings of quasicrystals." Canadian Journal of Physics 72, no. 7-8 (1994): 442–52. http://dx.doi.org/10.1139/p94-060.

Texte intégral

Résumé :

We introduce a notion of colouring the points of a quasicrystal analogous to the idea of colouring or grading of the points of a lattice. Our results apply to quasicrystals that can be coordinatized by the ring R of integers of the quadratic number field [Formula: see text] and provide a useful and wide ranging tool for determining of sub-quasicrystals of quasicrystals. Using the arithmetic properties of R we determine all possible finite colourings. As examples we discuss the 4-colours of vertices of a Penrose tiling arising as a subset of 5-colouring of an R lattice, and the 4-colouring of q

Styles APA, Harvard, Vancouver, ISO, etc.

6

KIERSTEAD, H. A., and A. V. KOSTOCHKA. "A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring." Combinatorics, Probability and Computing 17, no. 2 (2008): 265–70. http://dx.doi.org/10.1017/s0963548307008619.

Texte intégral

Résumé :

A proper vertex colouring of a graph is equitable if the sizes of colour classes differ by at most one. We present a new shorter proof of the celebrated Hajnal–Szemerédi theorem: for every positive integer r, every graph with maximum degree at most r has an equitable colouring with r+1 colours. The proof yields a polynomial time algorithm for such colourings.

Styles APA, Harvard, Vancouver, ISO, etc.

7

JUKNA, S., and G. SCHNITGER. "Triangle-Freeness is Hard to Detect." Combinatorics, Probability and Computing 11, no. 6 (2002): 549–69. http://dx.doi.org/10.1017/s0963548302005333.

Texte intégral

Résumé :

We show that recognizing the K3-freeness and K4-freeness of graphs is hard, respectively, for two-player nondeterministic communication protocols using exponentially many partitions and for nondeterministic syntactic read-r times branching programs.The key ingredient is a generalization of a colouring lemma, due to Papadimitriou and Sipser, which says that for every balanced red—blue colouring of the edges of the complete n-vertex graph there is a set of εn2 triangles, none of which is monochromatic, such that no triangle can be formed by picking edges from different triangles. We extend this

Styles APA, Harvard, Vancouver, ISO, etc.

8

Bard, Stefan, Gary MacGillivray, and Shayla Redlin. "The complexity of frugal colouring." Arabian Journal of Mathematics 10, no. 1 (2021): 51–57. http://dx.doi.org/10.1007/s40065-021-00311-7.

Texte intégral

Résumé :

AbstractA t-frugal colouring of a graph G is an assignment of colours to the vertices of G, such that each colour appears at most t times in the neighbourhood of any vertex. A dichotomy theorem for the complexity of deciding whether a graph has a 1-frugal colouring with k colours was found by McCormick and Thomas, and then later extended to restricted graph classes by Kratochvil and Siggers. We generalize the McCormick and Thomas theorem by proving a dichotomy theorem for the complexity of deciding whether a graph has a t-frugal colouring with k colours, for all pairs of positive integers t an

Styles APA, Harvard, Vancouver, ISO, etc.

9

Jungic, V., J. Licht, M. Mahdian, J. Nesetril, and R. Radoicic. "Rainbow Arithmetic Progressions and Anti-Ramsey Results." Combinatorics, Probability and Computing 12, no. 5-6 (2003): 599–620. http://dx.doi.org/10.1017/s096354830300587x.

Texte intégral

Résumé :

The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoičić conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic progression whose terms are coloured with distinct colours. In this paper, we prove that every 3-colouring of the set of natural numbers for which each colour class has density more than 1/6, contains a 3-term rainbow arithmetic progression. We also p

Styles APA, Harvard, Vancouver, ISO, etc.

10

Madaras, Tomáš, and Mária Šurimová. "Facial Homogeneous Colouring of Graphs." Symmetry 13, no. 7 (2021): 1213. http://dx.doi.org/10.3390/sym13071213.

Texte intégral

Résumé :

A proper colouring of a plane graph G is called facially homogeneous if it uses the same number of colours for every face of G. We study various sufficient conditions of facial homogeneous colourability of plane graphs, its relation to other facial colourings, and the extension of this concept for embedded graphs in general.

Styles APA, Harvard, Vancouver, ISO, etc.

11

Ganesan, Ghurumuruhan. "Acyclic and tree unique colourings in random graphs." Gulf Journal of Mathematics 16, no. 2 (2024): 27–38. http://dx.doi.org/10.56947/gjom.v16i2.1867.

Texte intégral

Résumé :

In this paper we study acyclic colouring in the random subgraph G of the complete graph Kn on n vertices where each edge is present with probability p, independent of the other edges. We show that unlike the ordinary chromatic number, the acyclic chromatic number exhibits a phase transition from sub-linear to linear growth as the edge probability increases, even in the sparse regime and obtain estimates for the critical exponent. We show that allowing for a small relaxation in the acyclic colouring condition allows for sublinear growth for all values of the edge probability exponent. We also s

Styles APA, Harvard, Vancouver, ISO, etc.

12

ZELENYUK, YEVHEN, and YULIYA ZELENYUK. "COUNTING SYMMETRIC COLOURINGS OF THE VERTICES OF A REGULAR POLYGON." Bulletin of the Australian Mathematical Society 90, no. 1 (2014): 1–8. http://dx.doi.org/10.1017/s0004972713001147.

Texte intégral

Résumé :

AbstractA colouring of the vertices of a regular polygon is symmetric if it is invariant under some reflection of the polygon. We count the number of symmetric$r$-colourings of the vertices of a regular$n$-gon.

Styles APA, Harvard, Vancouver, ISO, etc.

13

BERKE, R., and T. SZABÓ. "Deciding Relaxed Two-Colourability: A Hardness Jump." Combinatorics, Probability and Computing 18, no. 1-2 (2009): 53–81. http://dx.doi.org/10.1017/s0963548309009663.

Texte intégral

Résumé :

We study relaxations of proper two-colourings, such that the order of the induced monochromatic components in one (or both) of the colour classes is bounded by a constant. A colouring of a graph G is called (C1, C2)-relaxed if every monochromatic component induced by vertices of the first (second) colour is of order at most C1 (C2, resp.). We prove that the decision problem ‘Is there a (1, C)-relaxed colouring of a given graph G of maximum degree 3?’ exhibits a hardness jump in the component order C. In other words, there exists an integer f(3) such that the decision problem is NP-hard for eve

Styles APA, Harvard, Vancouver, ISO, etc.

14

Yasunaga, Hidekazu. "Colouring by Using Biobased Materials." Advanced Materials Research 441 (January 2012): 28–32. http://dx.doi.org/10.4028/www.scientific.net/amr.441.28.

Texte intégral

Résumé :

Novel colouring techniques by using biobased materials were studied. The orange or reddish orange colourant is obtained from (+)-catechin by an enzymatic reaction using tyrosinase. Human hair can be dyed orange or reddish orange by the colourant. The colourant does not cause reactions on skin such as erythema or oedema. The fastness to washing or light for hair dyed by it is high enough. The wool fabrics can be dyed by the treatment with (+)-catechin and the irradiation with ultraviolet light. The fastness to washing for the dyed wool is high enough. Woods are coloured with biobased materials

Styles APA, Harvard, Vancouver, ISO, etc.

15

KITTIPASSORN, TEERADEJ, and BHARGAV P. NARAYANAN. "A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs." Combinatorics, Probability and Computing 23, no. 1 (2013): 102–15. http://dx.doi.org/10.1017/s0963548313000503.

Texte intégral

Résumé :

Given an edge colouring of a graph with a set of m colours, we say that the graph is exactly m-coloured if each of the colours is used. We consider edge colourings of the complete graph on $\mathbb{N}$ with infinitely many colours and show that either one can find an exactly m-coloured complete subgraph for every natural number m or there exists an infinite subset X ⊂ $\mathbb{N}$ coloured in one of two canonical ways: either the colouring is injective on X or there exists a distinguished vertex v in X such that X\{v} is 1-coloured and each edge between v and X\{v} has a distinct colour (all d

Styles APA, Harvard, Vancouver, ISO, etc.

16

Machado, Raphael C. S., Celina M. H. de Figueiredo, and Nicolas Trotignon. "Edge-colouring and total-colouring chordless graphs." Discrete Mathematics 313, no. 14 (2013): 1547–52. http://dx.doi.org/10.1016/j.disc.2013.03.020.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

17

Zhu, Xuding. "Colouring graphs with bounded generalized colouring number." Discrete Mathematics 309, no. 18 (2009): 5562–68. http://dx.doi.org/10.1016/j.disc.2008.03.024.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

18

Šopová, Barbora, and Matilda Zemanová. "Electrolytic colouring of anodized aluminium on tin basis." Acta Chimica Slovaca 12, no. 1 (2019): 8–13. http://dx.doi.org/10.2478/acs-2019-0002.

Texte intégral

Résumé :

Abstract The aim of the study was to find parameters of electrolytic colouring on tin basis to form uniform black coatings on anodized aluminium. A two steps electrolytic process consisting of aluminium anodization in a sulphuric acid electrolyte and colouring in tin acidic electrolyte was used. Among parameters influencing the colouring process, AC colouring voltage, composition of the counter electrode and agitation of the colouring electrolyte were studied. Spectrocolorimetry was applied to analyse the quality of the colouring. Thickness of the coloured and sealed anodized specimens was als

Styles APA, Harvard, Vancouver, ISO, etc.

19

Axenovich, Maria, Tao Jiang, and Z. Tuza. "Local Anti-Ramsey Numbers of Graphs." Combinatorics, Probability and Computing 12, no. 5-6 (2003): 495–511. http://dx.doi.org/10.1017/s0963548303005868.

Texte intégral

Résumé :

A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different colours, and H is rainbow if no two edges of H are assigned the same colour. We study properly coloured subgraphs and rainbow subgraphs forced in edge-colourings of complete graphs in which each vertex is incident to a large number of colours.

Styles APA, Harvard, Vancouver, ISO, etc.

20

Bednarz, Urszula, Iwona Włoch, and Małgorzata Wołowiec-Musiał. "Total Graph Interpretation of the Numbers of the Fibonacci Type." Journal of Applied Mathematics 2015 (2015): 1–7. http://dx.doi.org/10.1155/2015/837917.

Texte intégral

Résumé :

We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give the lower bound and the upper bound for the number of all(A1,2A1)-edge colourings in trees.

Styles APA, Harvard, Vancouver, ISO, etc.

21

Marcu, Dănuţ. "Note on graphs colouring." Mathematica Bohemica 117, no. 2 (1992): 157–58. http://dx.doi.org/10.21136/mb.1992.125898.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

22

Pandey, Priyanka, and Joseph Varghese Kureethara. "L(t, 1)-Colouring of Cycles." Mapana - Journal of Sciences 17, no. 3 (2018): 29–42. http://dx.doi.org/10.12723/mjs.46.3.

Texte intégral

Résumé :

For a given finite set T including zero, an L(t, 1)-colouring of a graph G is an assignment of non-negative integers to the vertices of G such that the difference between the colours of adjacent vertices must not belong to the set T and the colours of vertices that are at distance two must be distinct. For a graph G, the L(t, 1)-span of G is the minimum of the highest colour used to colour the vertices of a graph out of all the possible L(t, 1)-colourings. We study the L(t, 1)-span of cycles with respect to specific sets.

Styles APA, Harvard, Vancouver, ISO, etc.

23

KAMČEV, NINA, TOMASZ ŁUCZAK, and BENNY SUDAKOV. "Anagram-Free Colourings of Graphs." Combinatorics, Probability and Computing 27, no. 4 (2017): 623–42. http://dx.doi.org/10.1017/s096354831700027x.

Texte intégral

Résumé :

A sequenceSis calledanagram-freeif it contains no consecutive symbolsr1r2. . .rkrk+1. . .r2ksuch thatrk+1. . .r2kis a permutation of the blockr1r2. . .rk. Answering a question of Erdős and Brown, Keränen constructed an infinite anagram-free sequence on four symbols. Motivated by the work of Alon, Grytczuk, Hałuszczak and Riordan [2], we consider a natural generalization of anagram-free sequences for graph colourings. A colouring of the vertices of a given graphGis calledanagram-freeif the sequence of colours on any path inGis anagram-free. We call the minimal number of colours needed for such

Styles APA, Harvard, Vancouver, ISO, etc.

24

Lloyd, Beck. "Colouring In." Canadian Theatre Review 188 (October 1, 2021): 34–38. http://dx.doi.org/10.3138/ctr.188.008.

Texte intégral

Résumé :

In an open letter to the camera, reflective writing, poetry, and a photo series, Beck Lloyd examines the structure of racial passing as it shapes fear and limitation in performance and asks, “What stories can this body tell that others can’t?”

Styles APA, Harvard, Vancouver, ISO, etc.

25

Arkins, Brian. "POETIC COLOURING." Classical Review 54, no. 2 (2004): 378–80. http://dx.doi.org/10.1093/cr/54.2.378.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

26

Hilditch, E. A. "Colouring Wood." Review of Progress in Coloration and Related Topics 13, no. 1 (2008): 50–61. http://dx.doi.org/10.1111/j.1478-4408.1983.tb03727.x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

27

Corbett, John F. "Hair Colouring." Review of Progress in Coloration and Related Topics 15, no. 1 (2008): 52–65. http://dx.doi.org/10.1111/j.1478-4408.1985.tb03736.x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

28

Carbery, Anthony, and Stefán Ingi Valdimarsson. "Colouring Multijoints." Discrete & Computational Geometry 52, no. 4 (2014): 730–42. http://dx.doi.org/10.1007/s00454-014-9611-8.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

29

KANG, ROSS J., and FRANÇOIS PIROT. "Distance Colouring Without One Cycle Length." Combinatorics, Probability and Computing 27, no. 5 (2018): 794–807. http://dx.doi.org/10.1017/s0963548318000068.

Texte intégral

Résumé :

We consider distance colourings in graphs of maximum degree at most d and how excluding one fixed cycle of length ℓ affects the number of colours required as d → ∞. For vertex-colouring and t ⩾ 1, if any two distinct vertices connected by a path of at most t edges are required to be coloured differently, then a reduction by a logarithmic (in d) factor against the trivial bound O(dt) can be obtained by excluding an odd cycle length ℓ ⩾ 3t if t is odd or by excluding an even cycle length ℓ ⩾ 2t + 2. For edge-colouring and t ⩾ 2, if any two distinct edges connected by a path of fewer than t edges

Styles APA, Harvard, Vancouver, ISO, etc.

30

Harutyunyan, Ararat, P. Mark Kayll, Bojan Mohar, and Liam Rafferty. "Uniquely D-colourable Digraphs with Large Girth." Canadian Journal of Mathematics 64, no. 6 (2012): 1310–28. http://dx.doi.org/10.4153/cjm-2011-084-9.

Texte intégral

Résumé :

Abstract Let C and D be digraphs. A mapping f : V(D) →V(C) is a C-colouring if for every arc uv of D, either f (u) f (v) is an arc of C or f (u) = f (v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colourable if it admits a C-colouring and that D is uniquely C-colourable if it is surjectively C-colourable and any two C-colourings of D differ by an automorphism of C. We prove that if a digraph D is not C-colourable, then there exist digraphs of arbitrarily large girth that are D-colourable but not C-colourable. Moreover, for every digraph D that

Styles APA, Harvard, Vancouver, ISO, etc.

31

Aszalós, László, and Mária Bakó. "Distance-constrained grid colouring." Acta Universitatis Sapientiae, Informatica 8, no. 1 (2016): 5–15. http://dx.doi.org/10.1515/ausi-2016-0001.

Texte intégral

Résumé :

Abstract Distance-constrained colouring is a mathematical model of the frequency assignment problem. This colouring can be treated as an optimization problem so we can use the toolbar of the optimization to solve concrete problems. In this paper, we show performance of distance-constrained grid colouring for two methods which are good in map colouring.

Styles APA, Harvard, Vancouver, ISO, etc.

32

Satti, Mansoor. "Families of Disjoint Sets Colouring (Partitioning) Technique and Standard of Partition for Edge Colouring." International Journal for Scientific Research 4, no. 3 (2025): 267–91. https://doi.org/10.59992/ijsr.2025.v4n3p12.

Texte intégral

Résumé :

Families of disjoint sets colouring (partitioning) technique is trial to unify and generalize all types of colouring such as edge colouring, vertex colouring, and face colouring. The concept of standard of partitioning edges into colour classes is essential concept to follow and understand families of disjoint sets colouring (partitioning) technique. In this paper, we introduce some examples of standard of partitioning, and introduce some results of partitioning edges. Some of these results explain importance of standard of partitioning related to subgraphs, and some results related to maximum

Styles APA, Harvard, Vancouver, ISO, etc.

33

Ali, Elrasheed Abdalla, Walaa Abdalateef Abdalla, and Mohanad Hassan Mohamed. "Food colouring additives in selected confectioneries in Khartoum state, Sudan." International Journal Of Community Medicine And Public Health 4, no. 7 (2017): 2248. http://dx.doi.org/10.18203/2394-6040.ijcmph20172814.

Texte intégral

Résumé :

Background: The natural food colours extracted from plants are used to dye different foods do not change their properties when they are used. Therefore, most synthetic coloured additives are carcinogenic, teratogenic and cause impairment of vision, tooth decay. The aim of the study was to determine food colouring additives in confectioneries.Methods: A descriptive cross-sectional study was designed and confectioneries samples include Cane, Ice-cream and Lollipop was randomly collected from venders around schools, transport stations and other places in Khartoum state through (May - June / 2014)

Styles APA, Harvard, Vancouver, ISO, etc.

34

Kim, Ringi, Seog‐Jin Kim, and Xuding Zhu. "Signed colouring and list colouring of k‐chromatic graphs." Journal of Graph Theory 99, no. 4 (2021): 637–50. http://dx.doi.org/10.1002/jgt.22756.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

35

Machado, Raphael, and Celina de Figueiredo. "Complexity separating classes for edge-colouring and total-colouring." Journal of the Brazilian Computer Society 17, no. 4 (2011): 281–85. http://dx.doi.org/10.1007/s13173-011-0040-8.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

36

Macêdo Filho, H. B., S. Dantas, R. C. S. Machado, and C. M. H. Figueiredo. "Biclique-colouring verification complexity and biclique-colouring power graphs." Discrete Applied Mathematics 192 (September 2015): 65–76. http://dx.doi.org/10.1016/j.dam.2014.05.001.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

37

Marcu, Dănuţ. "A note on graph colouring." Czechoslovak Mathematical Journal 45, no. 2 (1995): 231–33. http://dx.doi.org/10.21136/cmj.1995.128528.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

38

Marcu, Dănuţ. "On colouring products of graphs." Mathematica Bohemica 121, no. 1 (1996): 69–71. http://dx.doi.org/10.21136/mb.1996.125938.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

39

Smirnov, Alexander Valeryevich. "Two-Step Colouring of Grid Graphs of Different Types." Modeling and Analysis of Information Systems 29, no. 3 (2022): 166–80. http://dx.doi.org/10.18255/1818-1015-2022-3-166-180.

Texte intégral

Résumé :

In this article, we consider the NP-hard problem of the two-step colouring of a graph. It is required to colour the graph in a given number of colours in a way, when no pair of vertices has the same colour, if these vertices are at a distance of 1 or 2 between each other. The optimum two-step colouring is one that uses the minimum possible number of colours.The two-step colouring problem is studied in application to grid graphs. We consider four types of grids: triangular, square, hexagonal, and octogonal. We show that the optimum two-step colouring of hexagonal and octogonal grid graphs requi

Styles APA, Harvard, Vancouver, ISO, etc.

40

Satti, Mansoor. "How to Maximize Minimum Number of Colour Classes for Edge Colouring Using Families of Disjoint Sets Colouring Technique." International Journal for Scientific Research 3, no. 12 (2024): 214–30. https://doi.org/10.59992/ijsr.2024.v3n12p7.

Texte intégral

Résumé :

In this paper we use families of disjoint sets colouring technique, to introduce some results of edge colouring for minimum and maximum number of colour classes, and introduce a results explains how to find different values of minimum colour classes, and how to maximize minimum number of colour classes for edge colouring, when maximum degree of vertex is fixed, here we prove a result as a method for finding minimum number of colour classes for edge colouring. Families of disjoint sets colouring technique, as generalization technique deal even with graph of multiple edges, and here graph of mul

Styles APA, Harvard, Vancouver, ISO, etc.

41

V, Kaviyaa, and Manikandan M. "Characterization of a Vertex Colouring of a Double Layered Complete Fuzzy Graph Using ? – CUT." International Journal for Research in Applied Science and Engineering Technology 10, no. 11 (2022): 1367–73. http://dx.doi.org/10.22214/ijraset.2022.47510.

Texte intégral

Résumé :

Abstract: In this paper we defined a new fuzzy graph named Double layered complete fuzzy graph. (DLCFG). The double layered complete fuzzy graph gives a 3-D structure. Further we introduced vertex colouring of the double layered complete fuzzy graph using α-cut. Keywords: Graph theory, Fuzzy graph, colouring of graphs, double layered fuzzy graph, complete fuzzy graph, alpha cut, colouring of double layered fuzzy graph, colouring of double layered complete fuzzy using alpha cut.

Styles APA, Harvard, Vancouver, ISO, etc.

42

ZELENYUK, YEVHEN, and YULIYA ZELENYUK. "COUNTING SYMMETRIC BRACELETS." Bulletin of the Australian Mathematical Society 89, no. 3 (2013): 431–36. http://dx.doi.org/10.1017/s0004972713000701.

Texte intégral

Résumé :

AbstractAn $r$-ary necklace (bracelet) of length $n$ is an equivalence class of $r$-colourings of vertices of a regular $n$-gon, taking all rotations (rotations and reflections) as equivalent. A necklace (bracelet) is symmetric if a corresponding colouring is invariant under some reflection. We show that the number of symmetric $r$-ary necklaces (bracelets) of length $n$ is $\frac{1}{2} (r+ 1){r}^{n/ 2} $ if $n$ is even, and ${r}^{(n+ 1)/ 2} $ if $n$ is odd.

Styles APA, Harvard, Vancouver, ISO, etc.

43

Sangeetha Devi, A. "An Extensive Study on Graph Colourings and Dominator Chromatic Number of Sugeno-Type Fuzzy Graphs." Mathematical Problems in Engineering 2022 (September 28, 2022): 1–7. http://dx.doi.org/10.1155/2022/3135201.

Texte intégral

Résumé :

The concept of graph colouring has become a very active field of research that enhances many practical applications and theoretical challenges. An accurate (vertex) colouring through the condition that each vertex is whichever unaccompanied in its colour class or adjoining to all vertices of at least one colour class is known as dominator colouring. A graph is dominator colouring is a suitable colouring in which at least one vertex dominates each colour class. Many difficult and global issues are solved using fuzzy graph colouring approaches. In this paper, we introduce a new Sugeno-Type Fuzzy

Styles APA, Harvard, Vancouver, ISO, etc.

44

Y. Abba, Z., S. M.Gumel, A. A.Idris, and M. A.Ibrahim. "Formulation of Paint using Natural Pigment from Lawsonia Inermis Leaves." International Journal of Advanced Chemistry 8, no. 1 (2020): 155. http://dx.doi.org/10.14419/ijac.v8i1.30712.

Texte intégral

Résumé :

The increased application of paint in coating industry for interior and exterior decoration and corrosion inhibition, has inspired research in paint formulations. However, due to the toxic effect of preparatory chemicals used in paints, and the restrictive environmental legislation, research efforts have been directed to a more green process. In this work colouring matter from Lawsonia inermis leaves were extracted using water and analyzed by TLC and FTIR spectroscopy. White emulsion paint was formulated using pigment volume concentration (PVC) of 0.07%, the colouring matter extract was disper

Styles APA, Harvard, Vancouver, ISO, etc.

45

Giller, R. H. "Colouring Ceramic Bodies." Key Engineering Materials 53-55 (January 1991): 191–96. http://dx.doi.org/10.4028/www.scientific.net/kem.53-55.191.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

46

Williams, S. "Colouring in anatomy." Veterinary Record 168, no. 13 (2011): 358. http://dx.doi.org/10.1136/vr.d2054.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

47

Komjáth, Péter. "The Colouring Number." Proceedings of the London Mathematical Society s3-54, no. 1 (1987): 1–14. http://dx.doi.org/10.1112/plms/s3-54.1.1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

48

Gegenfurtner, Karl R. "Colouring the cortex." Nature 388, no. 6637 (1997): 23–24. http://dx.doi.org/10.1038/40275.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

49

KNECHT, COMMUNICATION FROM EDMUND. "NEW COLOURING MATTERS." Journal of the Society of Dyers and Colourists 1, no. 12 (2008): 266–67. http://dx.doi.org/10.1111/j.1478-4408.1885.tb00011.x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

50

KNECHT, EDMUND. "NEW COLOURING MATTERS." Journal of the Society of Dyers and Colourists 2, no. 10 (2008): 154–55. http://dx.doi.org/10.1111/j.1478-4408.1886.tb00261.x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!