Gotowe bibliografie tematyczne / Harmonious coloring

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Książki
  4. Części książek

Gotowa bibliografia na temat „Harmonious coloring”

Autor: Grafiati
Data publikacji: 3 czerwca 2025
Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Harmonious coloring”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Harmonious coloring"

1

Thamil Selvi.M.S, Franklin, Amutha A, and Antony Mary A. "A Study on Harmonious Coloring of Circulant Networks." International Journal of Engineering & Technology 7, no. 4.10 (2018): 393. http://dx.doi.org/10.14419/ijet.v7i4.10.20945.

Pełny tekst źródła
Streszczenie:
Given a simple graph , a harmonious coloring of is the proper vertex coloring such that each pair of colors seems to appears together on at most one edge. The harmonious chromatic number of , denoted by is the minimal number of colors in a harmonious coloring of . In this paper we have determined the harmonious chromatic number of some classes of Circulant Networks.
Style APA, Harvard, Vancouver, ISO itp.
2

M. Siva. "Locally Harmonious Chromatic Number of Certain Tree-Structured Networks." Communications on Applied Nonlinear Analysis 32, no. 3s (2024): 212–21. https://doi.org/10.52783/cana.v32.2601.

Pełny tekst źródła
Streszczenie:
Graph coloring is one of the oldest and best-known problems of graph theory. The locally harmonious coloring of G is a proper vertex coloring in which adjacent edges receive different color pairs [3]. In another way, all the vertices in N [v] receive different colors for all v in G. The minimum number of colors required to obtain a locally harmonious coloring of a graph G is called the locally harmonious chromatic number of G and is denoted by h1(G). In this paper, we investigate the locally harmonious chromatic number of slim tree, hypertree, shuffle hypertree and l-complete binary tree.
Style APA, Harvard, Vancouver, ISO itp.
3

Bosek, Bartłomiej, Sebastian Czerwiński, Jarosław Grytczuk, and Paweł Rzążewski. "Harmonious coloring of uniform hypergraphs." Applicable Analysis and Discrete Mathematics 10, no. 1 (2016): 73–87. http://dx.doi.org/10.2298/aadm160411008b.

Pełny tekst źródła
Streszczenie:
A harmonious coloring of a k-uniform hypergraph H is a vertex coloring such that no two vertices in the same edge share the same color, and each k-element subset of colors appears on at most one edge. The harmonious number h(H) is the least number of colors needed for such a coloring. We prove that k-uniform hypergraphs of bounded maximum degree ? satisfy h(H) = O(k?k!m), where m is the number of edges in H which is best possible up to a multiplicative constant. Moreover, for every fixed ?, this constant tends to 1 with k ? ?. We use a novel method, called entropy compression, that emerged fro
Style APA, Harvard, Vancouver, ISO itp.
4

Gao, Wei. "Remarks on Fractional Locally Harmonious Coloring." Open Journal of Mathematical Sciences 2(2018), no. 1 (2018): 301–6. http://dx.doi.org/10.30538/oms2018.0036.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Mansuri, Akhlak, Rohit Mehta, and R. S. Chandel. "1-Harmonious coloring of triangular snakes." Malaya Journal of Matematik 8, no. 4 (2020): 2116–21. http://dx.doi.org/10.26637/mjm0804/0135.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Liu, Jia-Bao, Micheal Arockiaraj, and Antony Nelson. "Tight Bounds on 1-Harmonious Coloring of Certain Graphs." Symmetry 11, no. 7 (2019): 917. http://dx.doi.org/10.3390/sym11070917.

Pełny tekst źródła
Streszczenie:
Graph coloring is one of the most studied problems in graph theory due to its important applications in task scheduling and pattern recognition. The main aim of the problem is to assign colors to the elements of a graph such as vertices and/or edges subject to certain constraints. The 1-harmonious coloring is a kind of vertex coloring such that the color pairs of end vertices of every edge are different only for adjacent edges and the optimal constraint that the least number of colors is to be used. In this paper, we investigate the graphs in which we attain the sharp bound on 1-harmonious col
Style APA, Harvard, Vancouver, ISO itp.
7

TAKAOKA, Asahi, Shingo OKUMA, Satoshi TAYU, and Shuichi UENO. "A Note on Harmonious Coloring of Caterpillars." IEICE Transactions on Information and Systems E98.D, no. 12 (2015): 2199–206. http://dx.doi.org/10.1587/transinf.2015edp7113.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Miller, Z., and D. Pritikin. "The harmonious coloring number of a graph." Discrete Mathematics 93, no. 2-3 (1991): 211–28. http://dx.doi.org/10.1016/0012-365x(91)90257-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Kolay, Sudeshna, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, and Prafullkumar Tale. "Harmonious coloring: Parameterized algorithms and upper bounds." Theoretical Computer Science 772 (June 2019): 132–42. http://dx.doi.org/10.1016/j.tcs.2018.12.011.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Vivin.J, Vernold, Venkatachalam M., and Kaliraj K. "Harmonious coloring on double star graph families." Tamkang Journal of Mathematics 43, no. 2 (2012): 153–58. http://dx.doi.org/10.5556/j.tkjm.43.2012.675.

Pełny tekst źródła
Streszczenie:
In this present paper, we have proved for the line graph of double star graph, the harmonious chromatic number and the achromatic number are equal. As a motivation this work can be extended by classifying the different families of graphs for which these two numbers are equal.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Harmonious coloring"

1

Seddiki, Omar. "Réalisation et caractérisation d'une source laser femtoseconde : application à la génération de seconde harmonique en surface de gaas." Paris 6, 1986. http://www.theses.fr/1986PA066026.

Pełny tekst źródła
Streszczenie:
Montage d'un oscillateur laser à modes bloqués par collision d'impulsions. La configuration en anneau de ce type de laser permet la propagation en sens inverse de deux impulsions qui se synchronisent automatiquement dans un jet d'absorbant saturable. Cette collision d'impulsions dans le milieu crée un réseau d'absorption transitoire qui assure la synchronisation passive des modes indispensables à l'obtention d'impulsions de durées à l'échelle de la centaine de femtosecondes. Compte tenu qu'il n'est pas possible de mesurer des durées inferieures à quelques picosecondes par des moyens purement é
Style APA, Harvard, Vancouver, ISO itp.
2

"On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph." Thesis, 2009. http://hdl.handle.net/10210/2359.

Pełny tekst źródła
Streszczenie:
M.Sc.<br>In this dissertation we study two types of colourings, namely line-distinguishing colourings and harmonious colourings. A line-distinguishing colouring of a graph G is a k-colouring of the vertices of G such that no two edges have the same colour. The line-distinguishing chromatic number G is defined as the smallest k such that G has a line-distinguishing k-colouring. A harmonious colouring of a graph G is a proper k-colouring of the vertices of G such that no two edges have the same colour, i.e. no two adjacent vertices can have the same colour. The harmonious chromatic number hG
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Harmonious coloring"

1

R, Hay D. The Interior Decorator, Being the Laws of Harmonious Coloring Adapted to Interior Decorations With Observations on the Practice of House Painting. Franklin Classics, 2018.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

R, Hay D. The Interior Decorator, Being the Laws of Harmonious Coloring Adapted to Interior Decorations with Observations on the Practice of House Painting. Franklin Classics Trade Press, 2018.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

The Interior Decorator, Being the Laws of Harmonious Coloring Adapted to Interior Decorations With Observations on the Practice of House Painting. Franklin Classics, 2018.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Tudor, Bulus. Harmonious Combination Between a Planner for All Those Fighting with Cancer or for Survivors: & an Adult Coloring Book with Inspirational and Motivational Quotes. Independently Published, 2018.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Morgan, Ruby. Adult Coloring Book of 30 Funny Quotes for Harmonicas Lovers: 30 Funny Sayings and Beautiful Mandala Patterns to Color, Art Therapy Activity Book for Anxiety and Stress Relief, Mindful Meditation and Relaxation. Independently Published, 2020.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Harmonious coloring"

1

Kolay, Sudeshna, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, and Prafullkumar Tale. "Harmonious Coloring: Parameterized Algorithms and Upper Bounds." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53536-3_21.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Ioannidou, Kyriaki, and Stavros D. Nikolopoulos. "Harmonious Coloring on Subclasses of Colinear Graphs." In WALCOM: Algorithms and Computation. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11440-3_13.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Zhang, Ping. "Harmonious Vertex Colorings." In SpringerBriefs in Mathematics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30518-9_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Byers, Alexis, Alyssa Adams, Erica Bajo Calderon, et al. "Harmonious Colorings of Graphs." In Springer Proceedings in Mathematics & Statistics. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-52969-6_20.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Harmonious coloring” dla poszczególnych typów źródeł:
Artykuły w czasopismach
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii