Bibliographies thématiques / Colouring

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres
Actes de conférences
Rapports d'organisations

Littérature scientifique 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 listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques 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.

Articles de revues sur le sujet "Colouring"

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Plus de sources

Thèses sur le sujet "Colouring"

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

Texte intégral

Résumé :

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 q-Kneser graph are the k-dimensional subspaces of a vector space of dimension v over Fq, and two k-subspaces are adjacent if they have trivial intersection. The new results in this thesis involve colouring the q-Kneser graph when k=2. There are two cases. When k=2 and <e

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Résumé :

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 n vertices with valency greater than n/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

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Résumé :

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.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Livres sur le sujet "Colouring"

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.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Colouring Book: Colouring Book. Independently Published, 2021.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Colouring. Pearson Education Ltd., 1987.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Chapitres de livres sur le sujet "Colouring"

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Colouring"

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Résumé :

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.

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Colouring"

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Résumé :

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.  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.

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Résumé :

‘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.  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.

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!