Relevant bibliographies by topics / Colouring

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Colouring'

Author: Grafiati
Published: 4 June 2021
Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Colouring.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Colouring"

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Colouring"

1

Chowdhury, Ameerah. "Colouring Subspaces." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1026.

Full text
Abstract:
This thesis was originally motivated by considering vector space analogues of problems in extremal set theory, but our main results concern colouring a graph that is intimately related to these vector space analogues. The vertices of the <em>q</em>-Kneser graph are the <em>k</em>-dimensional subspaces of a vector space of dimension <em>v</em> over F<sub><em>q</em></sub>, and two <em>k</em>-subspaces are adjacent if they have trivial intersection. The new results in this thesis involve colouring the <em>q</em>-Kneser graph when <em>k</em>=2. There are two cases. When <em>k</em>=2 and <e
APA, Harvard, Vancouver, ISO, and other styles
2

Chu, Lei. "Colouring Cayley Graphs." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1125.

Full text
Abstract:
We will discuss three ways to bound the chromatic number on a Cayley graph. 1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will show that Cayley graphs cannot have chromatic number three. 2. We will prove a general statement that all vertex-transitive maximal triangle-free graphs on <i>n</i> vertices with valency greater than <i>n</i>/3 are 3-colourable. Since Cayley graphs are vertex-transitive, the bound of general graphs also applies to Cayley graphs. 3. Since Cayley graphs for a
APA, Harvard, Vancouver, ISO, and other styles
3

Quinn, Samuel. "Colouring naphthalene diimides." Thesis, University of Nottingham, 2018. http://eprints.nottingham.ac.uk/50038/.

Full text
Abstract:
Naphthalene diimides have been explored in a wide variety of ways; They are a promising candidate for organic electronics, boasting the ability to form n-type semiconductor materials, the stability of their anions further aiding in this regard. Their electron poor aromatic core can be used in host guest chemistry to generate interlocked species. The ability to tune their electronic properties and how this could be manipulated to create photovoltaic devices is primarily focus of this thesis. A series of naphthalene diimides substituted at the core with morpholine moieties have been synthesized
APA, Harvard, Vancouver, ISO, and other styles
4

Nielsen, Steven Ole. "Colouring a Lorentz gas." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ34034.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rackham, Tom. "Problems in graph colouring." Thesis, University of Oxford, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Williams, Jini. "Aspects of graph colouring." Thesis, Open University, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.410449.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kennedy, William. "Fractional edge and total colouring." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=106323.

Full text
Abstract:
Many problems which seek to schedule, sequence, or time-table a set of events subject to given constraints can be modelled as graph colouring problems. In this thesis, we study the edge and total colouring problems which, like all NP problems, can be formulated as integer programs and subjected to a two-pronged attack: we first solve the fractional relaxation and then use this solution to solve or obtain an approximation of the solution of the integer program. We focus on the complexity of solving the fractional relaxations of the integer programs for the edge and total colouring problems. For
APA, Harvard, Vancouver, ISO, and other styles
8

Meagher, Conor John. "Fractionally total colouring most graphs." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18201.

Full text
Abstract:
A total colouring is the assignment of a colour to each vertex and edge of a graph such that no adjacent vertices or incident edges receive the same colour and no edge receives the same colour as one of its endpoints. If we formulate the problem of finding the total chromatic number as an integer program, we can consider the fractional relaxation known as fractional total colouring. In this thesis we present an algorithm for computing the fractional total chromatic number of a graph, which runs in polynomial time on average. We also present an algorithm that asymptotically almost surely comput
APA, Harvard, Vancouver, ISO, and other styles
9

Gerke, Stefanie. "Weighted colouring and channel assignment." Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325977.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Watts, Ivor Llewellyn. "Overlap and fractional graph colouring." Thesis, Open University, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.505353.

Full text
Abstract:
Although a considerable body of material exists concerning the colouring of graphs, there is much less on overlap colourings. In this thesis, we investigate the colouring of certain families of graphs.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Colouring"

1

Steering Group on Food Surveillance. Working Party on Food Colours. Survey of colour usage in food: The nineteenth report of theSteering Group on Food Surveillance, the Working Party on Food Colours. HMSO, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nieto-Galan, Agustí. Colouring Textiles. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-017-1081-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Studios, Walt Disney Animation. Mega colouring. Parragon Books Ltd., 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Colorier, c'est un art! Les formes. Elcy éditions, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mihai. Colouring Book: Colouring Book. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Colouring Book: Colouring Book. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

riyu, shruhti. Floral Colouring: Floral Colouring. Independently Published, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Planners, Gilroys. Adult Colouring Book, Mandala Colouring Book, Art Therapy, Colouring for Adults, Relaxing Colouring Book, Therapeutic Colouring. Independently Published, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Colouring. 2nd ed. Longman Group United Kingdom, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Colouring. Pearson Education Ltd., 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Colouring"

1

Bollobás, Béla. "Colouring." In Modern Graph Theory. Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-0619-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Diestel, Reinhard. "Colouring." In Graph Theory. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lacasse, Katia, and Werner Baumann. "Colouring." In Textile Chemicals. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-642-18898-5_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Diestel, Reinhard. "Colouring." In Graph Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Diestel, Reinhard. "Colouring." In Graduate Texts in Mathematics. Springer Berlin Heidelberg, 2024. https://doi.org/10.1007/978-3-662-70107-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nieto-Galan, Agustí. "Natural Dyestuffs and the Kingdoms of Nature." In Colouring Textiles. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-017-1081-7_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nieto-Galan, Agustí. "Sites of Dyeing and Printing Textiles: From the Workshop to the Factory System." In Colouring Textiles. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-017-1081-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Nieto-Galan, Agustí. "The “Science” of Natural Dyestuffs in the Laboratory." In Colouring Textiles. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-017-1081-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Nieto-Galan, Agustí. "Circulating Skills in a European Network: The “Republic of Chemist-Dyers”." In Colouring Textiles. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-017-1081-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nieto-Galan, Agustí. "Artisans and Artists in Dyeing and Printing." In Colouring Textiles. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-017-1081-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Colouring"

1

Hobincă, Radu-Cosmin, and Lavinia-Eugenia Ferariu. "Colouring Grayscale Images Using Cycle-Generative-Adversarial Networks." In 2024 28th International Conference on System Theory, Control and Computing (ICSTCC). IEEE, 2024. http://dx.doi.org/10.1109/icstcc62912.2024.10744742.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Van Den Heuvel, J., and S. McGuinness. "Colouring and Labelling of Planar Graphs: (Extended Abstract)." In EMC_1998_Wroclaw. IEEE, 1998. https://doi.org/10.23919/emc.1998.10834634.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Lian, and Chengjun Zhou. "Design of Automatic Colouring of Sketch Images Based on Deep Learning Algorithm." In 2024 5th International Conference on Information Science, Parallel and Distributed Systems (ISPDS). IEEE, 2024. http://dx.doi.org/10.1109/ispds62779.2024.10667624.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jesenko, David, Aljaž Žel, Andraž Krivic, et al. "Colouring LiDAR Point Cloud of Wall Paintings From Images Based on ICP." In 2024 1st International Conference on Innovative and Intelligent Information Technologies (IC3IT). IEEE, 2024. https://doi.org/10.1109/ic3it63743.2024.10869409.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pastra, Katerina, and Horacio Saggion. "Colouring summaries BLEU." In the EACL 2003 Workshop. Association for Computational Linguistics, 2003. http://dx.doi.org/10.3115/1641396.1641402.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Weffort-Santos, C. A., and L. L. C. Pedrosa. "(Star, k)-colourings of graphs with bounded treewidth." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11085.

Full text
Abstract:
We study a generalization of graph colouring define as follows. Given a graph G, a (star, k)-colouring of G is a colouring c : V(G) → {1, ..., k} such that every colour class induces a star. We propose an O*(2^(O(tw))k^(tw)-time algorithm that decides whether a graph G of treewidth at most tw admits a (star, k)-colouring. This resolves an open problem posed by Angelini et al. in 2017. Our approach can be extended to other defective colouring models.
APA, Harvard, Vancouver, ISO, and other styles
7

Zatesko, Leandro M., Renato Carmo, and André L. P. Guedes. "Novel Procedures for Graph Edge-colouring." In XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6331.

Full text
Abstract:
We present a novel recolouring procedure for graph edge-colouring. We show that all graphs whose vertices have local degree sum not too large can be optimally edge-coloured in polynomial time. We also show that the set ofthe graphs satisfying this condition includes almost every graph (under the uniform distribution). We present further results on edge-colouring join graphs, chordal graphs, circular-arc graphs, and complementary prisms, whose proofs yield polynomial-time algorithms. Our results contribute towards settling the Over- full Conjecture, the main open conjecture on edge-colouring si
APA, Harvard, Vancouver, ISO, and other styles
8

Molloy, Michael, and Bruce Reed. "Asymptotically optimal frugal colouring." In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611973068.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Silvoster, M. Leena. "Graph colouring based image similarity." In 2012 International Conference on Power, Signals, Controls and Computation (EPSCICON). IEEE, 2012. http://dx.doi.org/10.1109/epscicon.2012.6175260.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dey, Munmun, and Amitava Bagchi. "Satisfiability Methods for Colouring Graphs." In National Conference on Advancement of Computing in Engineering Research. Academy & Industry Research Collaboration Center (AIRCC), 2013. http://dx.doi.org/10.5121/csit.2013.3213.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Colouring"

1

NARYKOVA, N. A., S. V. KHATAGOVA, and Yu R. PEREPELITSYNA. PEJORATIVE WORDS IN GERMAN MASS-MEDIA IN NOMINATIONS OF POLITICIANS. Science and Innovation Center Publishing House, 2022. http://dx.doi.org/10.12731/2077-1770-2021-14-1-3-57-68.

Full text
Abstract:
One of the main functions of mass media is influence on public opinion. So emotionally-painted lexical means are widely used in mass media in relation to leading politicians who are the centre of political arena. They are exposed to the frequent criticism, a negative estimation. The present article is devoted to the consideration of pejorative lexicon which is applied in nominations for heads of states. An empirical material of research were electronic newspapers and editions: Der Spiegel, Die Zeit, Sueddeutsche Zeitung, Der Tagesspiegel, taz, Die Welt, Gegenblende. As the basic methods of res
APA, Harvard, Vancouver, ISO, and other styles
2

Veloso, Rita Carvalho, Catarina Dias, Andrea Resende Souza, Joana Maia, Nuno M. M. Ramos, and João Ventura. Improving the optical properties of finishing coatings for façade systems. Department of the Built Environment, 2023. http://dx.doi.org/10.54337/aau541592743.

Full text
Abstract:
The need to improve energy efficiency of the building stock has led to a continuous increase in the implementation of exterior thermal insulation systems, such as ETICS. Progressively, these systems are being applied with darker colours, increasing the concern for hygrothermal behaviour and durability. Despite the significant developed studies, very few reports regarding their optical properties are available. The optical and catalytic capacity turns nanomaterials into excellent candidates for use in finishing coatings with high solar reflectance with dark colours without affecting the aesthet
APA, Harvard, Vancouver, ISO, and other styles
3

Colouring the Mind: Racism and Mental Health - The Concept. ACAMH, 2023. http://dx.doi.org/10.13056/acamh.25265.

Full text
Abstract:
The 'Colouring the Mind: Racism and Mental Health' series is a new mini In Conversations series that will explore how racism affects mental health, with a particular focus on racism in the mental health system and racism in the mental health concept.&#x0D; &#x0D; In this episode, Malaika Okundi and Jessica O’Logbon focus on the concept of racism in mental health and discuss definitions of race, racism, and mental health as concepts.
APA, Harvard, Vancouver, ISO, and other styles
4

Colouring the Mind: Racism and Mental Health – The System. ACAMH, 2024. http://dx.doi.org/10.13056/acamh.26554.

Full text
Abstract:
‘Colouring the Mind: Racism and Mental Health’ is a new In Conversation mini-series that will explore how racism affects mental health, with a particular focus on racism in the mental health system and racism in the mental health concept.&#x0D; &#x0D; In this episode, Malaika Okundi and Jessica O’Logbon focus on racism in the mental health system and discuss what the mental health system is, how people of colour are treated in the mental health system, and where we can go from here.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Colouring' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography