Relevant bibliographies by topics / Coloring graph / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Coloring graph.

Dissertations / Theses on the topic 'Coloring graph'

Author: Grafiati
Published: 3 June 2025
Last updated: 31 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Coloring graph.'

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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Sun, Pak Kiu. "Incidence coloring : origins, developments and relation with other colorings." HKBU Institutional Repository, 2007. http://repository.hkbu.edu.hk/etd_ra/826.

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

Araujo, Julio. "Graph coloring and graph convexity." Nice, 2012. http://www.theses.fr/2012NICE4032.

Full text
Abstract:
Dans cette thèse, nous étudions plusieurs problèmes de théorie des graphes concernant la coloration et la convexité des graphes. La plupart des résultats figurant ici sont liés à la complexité de calcul de ces problèmes pour certaines classes de graphes. Dans la première, et principale, partie de cette thèse, nous traitons la coloration des graphes qui est l’un des domaines les plus étudiés de théorie des graphes. Nous considérons d’abord trois problèmes de coloration appelés coloration gloutonne, coloration pondérée et coloration pondérée impropre. Ensuite, nous traitons un problème de décisi
APA, Harvard, Vancouver, ISO, and other styles
3

Normann, Per. "Parallel graph coloring : Parallel graph coloring on multi-core CPUs." Thesis, Uppsala universitet, Avdelningen för beräkningsvetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227656.

Full text
Abstract:
In recent times an evident trend in hardware is to opt for multi-core CPUs. This has lead to a situation where an increasing number of sequential algorithms are parallelized to fit these new multi-core environments. The greedy Multi-Coloring algorithm is a strictly sequential algorithm that is used in a wide range of applications. The application in focus is on decomposition by graph coloring for preconditioning techniques suitable for iterative solvers like the and methods. In order to perform all phases of these iterative solvers in parallel the graph analysis phase needs to be parallelized.
APA, Harvard, Vancouver, ISO, and other styles
4

Labelle, François. "Graph embeddings and approximate graph coloring." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0031/MQ64386.pdf.

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

Le, Ngoc Khang. "Detecting and Coloring some Graph Classes." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSEN021/document.

Full text
Abstract:
Les graphes sont des structures mathématiques utilisées pour modéliser les relations par paires entre objets. Malgré leur structure simple, les graphes ont des applications dans divers domaines tels que l'informatique, la physique, la biologie et la sociologie. L'objectif principal de ce travail est de continuer l'étude des problèmes de coloration et de détection dans le cadre de classes de graphes fermées par sous-graphes induits (que nous appelons classes de graphes héréditaires).La première classe que nous considérons est graphes sans ISK4 - les graphes qui ne contiennent aucune subdivision
APA, Harvard, Vancouver, ISO, and other styles
6

Casselgren, Carl Johan. "On some graph coloring problems." Doctoral thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-43389.

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

Bacak, Gökşen Ufuktepe Ünal. "Vertex Coloring of A Graph/." [s.l.] : [s.n.], 2004. http://library.iyte.edu.tr/tezler/master/matematik/T000416.pdf.

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

Beşeri, Tina Ufuktepe Ünal. "Edge Coloring of A Graph/." [s.l.]: [s.n.], 2004. http://library.iyte.edu.tr/tezler/master/matematik/T000439.pdf.

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

Jiang, Yiting. "Many aspects of graph coloring." Electronic Thesis or Diss., Université Paris Cité, 2022. https://wo.app.u-paris.fr/cgi-bin/WebObjects/TheseWeb.woa/wa/show?t=5613&f=42533.

Full text
Abstract:
La coloration des graphes est un sujet central en théorie des graphes, et divers concepts de coloration ont été étudiés dans la littérature. Cette thèse étudie certains de ces concepts de coloration et les problèmes associés. Il s'agit notamment de la coloration des graphes signés généralisés, du nombre de choix fractionnels forts des graphes, du nombre de coloration généralisé des graphes, de la largeur gémellaire des graphes, de la discordance (combinatoire) des systèmes d'ensembles définissables et des classes de graphes chi_p-bornées. Un graphe signé est une paire (G, sigma), où G est un g
APA, Harvard, Vancouver, ISO, and other styles
10

Gajewar, Amita Surendra. "Approximate edge 3-coloring of cubic graphs." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/29735.

Full text
Abstract:
Thesis (M. S.)--Computing, Georgia Institute of Technology, 2009.<br>Committee Chair: Prof. Richard Lipton; Committee Member: Prof. Dana Randall; Committee Member: Prof. H. Venkateswaran. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
11

Yerger, Carl Roger Jr. "Color-critical graphs on surfaces." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/37197.

Full text
Abstract:
A graph is (t+1)-critical if it is not t-colorable, but every proper subgraph is. In this thesis, we study the structure of critical graphs on higher surfaces. One major result in this area is Carsten Thomassen's proof that there are finitely many 6-critical graphs on a fixed surface. This proof involves a structural theorem about a precolored cycle C of length q. In general terms, he proves that a coloring, c, of C, can be extended inside the cycle, or there exists a subgraph H with at most a number of vertices exponential in q such that c can not be extended to a 5-coloring of H. In Cha
APA, Harvard, Vancouver, ISO, and other styles
12

Poon, Hoifung. "Coloring clique hypergraphs." Morgantown, W. Va. : [West Virginia University Libraries], 2000. http://etd.wvu.edu/templates/showETD.cfm?recnum=1494.

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

Ochem, Pascal. "Graph coloring and combinatorics on words." Bordeaux 1, 2005. http://www.theses.fr/2005BOR13083.

Full text
Abstract:
Dans une première partie, nous nous intéressons à différentes colorations de graphes peu denses, en particulier des sous-classes des graphes planaires. Nous apportons de nouveaux résultats concernant les colorations impropres acycliques et la coloration orientée. Nous définissons également de nouvelles colorations d'arètes, les arboricités T-libres, qui généralisent notamment l'arboricité étoile et l'arboricité chenille. Dans une seconde partie, nous considérons certains problèmes de combinatoire des mots. Nous présentons des avancées algorithmiques nous permettant d'étudier assez finement une
APA, Harvard, Vancouver, ISO, and other styles
14

Sun, Wen. "Heuristic Algorithms for Graph Coloring Problems." Thesis, Angers, 2018. http://www.theses.fr/2018ANGE0027/document.

Full text
Abstract:
Cette thèse concerne quatre problèmes de coloration de graphes NPdifficiles, à savoir le problème de coloration (GCP), le problème de coloration équitable (ECP), le problème de coloration des sommets pondérés et le problème de sous-graphe critique (k-VCS). Ces problèmes sont largement étudiés dans la littérature, non seulement pour leur difficulté théorique, mais aussi pour leurs applications réelles dans de nombreux domaines. Étant donné qu'ils appartiennent à la classe de problèmes NP-difficiles, il est difficile de les résoudre dans le cas général de manière exacte. Pour cette raison, cette
APA, Harvard, Vancouver, ISO, and other styles
15

Montgomery, Bruce Lee. "Dynamic coloring of graphs." Morgantown, W. Va. : [West Virginia University Libraries], 2001. http://etd.wvu.edu/templates/showETD.cfm?recnum=2109.

Full text
Abstract:
Thesis (Ph. D.)--West Virginia University, 2001.<br>Title from document title page. Document formatted into pages; contains viii, 52 p. : ill. Vita. Includes abstract. Includes bibliographical references (p. 51).
APA, Harvard, Vancouver, ISO, and other styles
16

AraÃjo, JÃlio CÃsar Silva. "Graph coloring and graph convexity / ColoraÃÃo em convexidade em grafos." Universidade Federal do CearÃ, 2012. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=8346.

Full text
Abstract:
MinistÃre de l'Enseignement SupÃrieur et de la Recherche<br>Nesta tese, estudamos vÃrios problemas de teoria dos grafos relativos à coloraÃÃo e convexidade em grafos. A maioria dos resultados contidos aqui sÃo ligados à complexidade computacional destes problemas para classes de grafos particulares. Na primeira, e principal, parte desta tese, discutimos coloraÃÃo de grafos que à uma das Ãreas mais importantes de teoria dos grafos. Primeiro, consideramos trÃs problemas de coloraÃÃo chamados coloraÃÃo gulosa, coloraÃÃo ponderada e coloraÃÃo ponderada imprÃpria. Em seguida, discutimos um problema
APA, Harvard, Vancouver, ISO, and other styles
17

Postle, Luke Jamison. "5-list-coloring graphs on surfaces." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45807.

Full text
Abstract:
Thomassen proved that there are only finitely many 6-critical graphs embeddable on a fixed surface. He also showed that planar graphs are 5-list-colorable. This thesis develops new techniques to prove general theorems for 5-list-coloring graphs embedded in a fixed surface. Indeed, a general paradigm is established which improves a number of previous results while resolving several open conjectures. In addition, the proofs are almost entirely self-contained. In what follows, let S be a fixed surface, G be a graph embedded in S and L a list assignment such that, for every vertex v of G, L(v) h
APA, Harvard, Vancouver, ISO, and other styles
18

Song, Zengmin. "Cycles and coloring in graphs." HKBU Institutional Repository, 2001. http://repository.hkbu.edu.hk/etd_ra/285.

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

Goyal, Mini, and University of Lethbridge Faculty of Arts and Science. "Graph coloring in sparse derivative matrix computation." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2005, 2005. http://hdl.handle.net/10133/260.

Full text
Abstract:
There has been extensive research activities in the last couple of years to efficiently determine large sparse Jacobian matrices. It is now well known that the estimation of Jacobian matrices can be posed as a graph coloring problem. Unidirectional coloring by Coleman and More [9] and bidirectional coloring independently proposed by Hossain and Steihaug [23] and Coleman and Verma [12] are techniques that employ graph theoretic ideas. In this thesis we present heuristic and exact bidirectional coloring techniques. For bidirectional heuristic techniques we have implemented variants of largest fi
APA, Harvard, Vancouver, ISO, and other styles
20

Adams, Sarah E. "Chromatic Polynomials for Graphs with Split Vertices." Bowling Green State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1593819941367146.

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

Zickfeld, Florian. "On the Structure of Counterexamples to the Coloring Conjecture of Hajós." Thesis, Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4994.

Full text
Abstract:
Hajós conjectured that, for any positive integer k, every graph containing no K_(k+1)-subdivision is k-colorable. This is true when k is at most three, and false when k exceeds six. Hajós' conjecture remains open for k=4,5. We will first present some known results on Hajós' conjecture. Then we derive a result on the structure of 2-connected graphs with no cycle through three specified vertices. This result will then be used for the proof of the main result of this thesis. We show that any possible counterexample to Hajós' conjecture for k=4 with minimum number of vertices must be 4-con
APA, Harvard, Vancouver, ISO, and other styles
22

Li, Ching-man. "Various coloring problems on plane graphs." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B39006542.

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

Walls, Barrett Hamilton. "Coloring girth restricted graphs on surfaces." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/28939.

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

Li, Ching-man, and 李靜文. "Various coloring problems on plane graphs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B39006542.

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

Fowler, Thomas George. "Unique coloring of planar graphs." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/30358.

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

Dochtermann, Anton. "The topology of graph homomorphisms /." Thesis, Connect to this title online; UW restricted, 2007. http://hdl.handle.net/1773/5754.

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

Macon, Lisa Fischer. "Almost regular graphs and edge-face colorings of plane graphs." Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002507.

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

Li, Chao. "Semidefinite programming, binary codes and a graph coloring problem." Digital WPI, 2015. https://digitalcommons.wpi.edu/etd-theses/863.

Full text
Abstract:
"Experts in information theory have long been interested in the maximal size, A(n, d), of a binary error-correcting code of length n and minimum distance d, The problem of determining A(n, d) involves both the construction of good codes and the search for good upper bounds. For quite some time now, Delsarte's linear programming approach has been the dominant approach to obtaining the strongest general purpose upper bounds on the efficiency of error-correcting codes. From 1973 forward, the linear programming bound found many applications, but there were few significant theoretical advances unti
APA, Harvard, Vancouver, ISO, and other styles
29

Wu, Qinghua. "The maximum clique problems with applications to graph coloring." Angers, 2013. https://theses.hal.science/tel-01005886.

Full text
Abstract:
Le problème de la clique maximum (MCP) est un problème d'optimisation combinatoire important avec un large éventail d'applications pratiques dans de nombreux domaines, y compris la recherche d'information, l'analyse de la transmission du signal, la théorie de la classification, l'économie, la planification et l'ingénierie biomédicale. En outre, un certain nombre de problèmes d'optimisation combinatoire sont étroitement liés au MCP, tels que la coloration de graphe, la somme coloration, réglez détermination du gagnant emballage et optimale. Cette thèse est consacrée à l'élaboration d'approches
APA, Harvard, Vancouver, ISO, and other styles
30

Jin, Yan. "Hybrid metaheuristic algorithms for sum coloring and bandwidth coloring." Thesis, Angers, 2015. http://www.theses.fr/2015ANGE0062/document.

Full text
Abstract:
Le problème de somme coloration minimum (MSCP) et le problème de coloration de bande passante (BCP) sont deux généralisations importantes du problème de coloration des sommets classique avec de nombreuses applications dans divers domaines, y compris la conception de circuits imprimés, la planication, l’allocation de ressource, l’affectation de fréquence dans les réseaux mobiles, etc. Les problèmes MSCP et BCP étant NP-difficiles, les heuristiques et métaheuristiques sont souvent utilisées en pratique pour obtenir des solutions de bonne qualité en un temps de calcul acceptable. Cette thèse est
APA, Harvard, Vancouver, ISO, and other styles
31

Macon, Lisa. "ALMOST REGULAR GRAPHS AND EDGE FACE COLORINGS OF PLANE GRAPHS." Doctoral diss., University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2480.

Full text
Abstract:
Regular graphs are graphs in which all vertices have the same degree. Many properties of these graphs are known. Such graphs play an important role in modeling network configurations where equipment limitations impose a restriction on the maximum number of links emanating from a node. These limitations do not enforce strict regularity, and it becomes interesting to investigate nonregular graphs that are in some sense close to regular. This dissertation explores a particular class of almost regular graphs in detail and defines generalizations on this class. A linear-time algorithm for the creat
APA, Harvard, Vancouver, ISO, and other styles
32

Chan, Wai Hong. "The bandwidth and coloring problems of graphs." HKBU Institutional Repository, 2003. http://repository.hkbu.edu.hk/etd_ra/472.

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

Legay, Sylvain. "Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLS030/document.

Full text
Abstract:
Le sujet de cette thèse est la théorie des graphes. Formellement, un graphe est un ensemble de sommets et un ensemble d’arêtes, c’est à dire de paires de sommets, qui relient les sommets. Cette thèse traite de différents problèmes de décisions binaires ou de minimisations liés à la notion de graphe, et cherche, pour chacun de ces problèmes, à déterminer sa classe de complexité, ou à fournir un algorithme. Le premier chapitre concerne le problème de trouver le plus petit sous-graphe connexe tropical dans un graphe sommet-colorié, c’est à dire le plus petit sous-graphe connexe contenant toutes l
APA, Harvard, Vancouver, ISO, and other styles
34

Tahraoui, Mohammed Amin. "Coloring, packing and embedding of graphs." Phd thesis, Université Claude Bernard - Lyon I, 2012. http://tel.archives-ouvertes.fr/tel-00995041.

Full text
Abstract:
In this thesis, we investigate some problems in graph theory, namelythe graph coloring problem, the graph packing problem and tree pattern matchingfor XML query processing. The common point between these problems is that theyuse labeled graphs.In the first part, we study a new coloring parameter of graphs called the gapvertex-distinguishing edge coloring. It consists in an edge-coloring of a graph G whichinduces a vertex distinguishing labeling of G such that the label of each vertex isgiven by the difference between the highest and the lowest colors of its adjacentedges. The minimum number of
APA, Harvard, Vancouver, ISO, and other styles
35

Roussel, Nicolas. "Circular coloring and acyclic choosability of graphs." Thesis, Bordeaux 1, 2009. http://www.theses.fr/2009BOR13889/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à la coloration circulaire des graphes planaires. Des bornes supérieures ont été données pour des graphes avec degré maximum borné, avec girth, la longueur de son plus petit cycle, bornée, avec des cycles manquants, etc. Ici nous donnerons de nouvelles bornes pour les graphes avec degré moyen maximum borné. Nous étudions également la coloration totale et la coloration (d,1)-totale de plusieurs familles infinies de graphes. Nous décrivons le nouveau concept de coloration (d,1)-totale circulaire. Enfin, nous discutons les conditions nécessaires pour qu'un
APA, Harvard, Vancouver, ISO, and other styles
36

Coker, Thomas David. "Graph colouring and bootstrap percolation with recovery." Thesis, University of Cambridge, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.610806.

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

Chen, Min. "Vertex coloring of graphs via the discharging method." Thesis, Bordeaux 1, 2010. http://www.theses.fr/2010BOR14090/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à differentes colorations des sommets d’un graphe et aux homomorphismes de graphes. Nous nous intéressons plus spécialement aux graphes planaires et aux graphes peu denses. Nous considérons la coloration propre des sommets, la coloration acyclique, la coloration étoilée, lak-forêt-coloration, la coloration fractionnaire et la version par liste de la plupart de ces concepts.Dans le Chapitre 2, nous cherchons des conditions suffisantes de 3-liste colorabilité des graphes planaires. Ces conditions sont exprimées en termes de sous-graphes interdits et nos ré
APA, Harvard, Vancouver, ISO, and other styles
38

Ahadi, Moghaddam Masoumeh [Verfasser], and Dietmar [Akademischer Betreuer] Schweigert. "Graph Coloring Applications and Defining Sets in Graph Theory / Masoumeh Ahadi Moghaddam ; Betreuer: Dietmar Schweigert." Kaiserslautern : Technische Universität Kaiserslautern, 2017. http://d-nb.info/1127044435/34.

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

Ren, Tiegeng. "Graph coloring algorithms for TDMA scheduling in wireless sensor networks /." View online ; access limited to URI, 2007. http://0-digitalcommons.uri.edu.helin.uri.edu/dissertations/AAI3298376.

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

Hesterberg, Adam Classen. "Closed quasigeodesics, escaping from polygons, and conflict-free graph coloring." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/117875.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 56-58).<br>Closed quasigeodesics. A closed quasigeodesic on the surface of a polyhedron is a loop which can everywhere locally be unfolded to a straight line: thus, it's straight on faces, uniquely determined on edges, and has as much flexibility at a vertex as that vertex's curvature. On any polyhedron, at least three closed quasigeodesics are known to exist, by a nonconstructive topological proof. We present an algorith
APA, Harvard, Vancouver, ISO, and other styles
41

Bozdag, Doruk. "Graph Coloring and Clustering Algorithms for Science and Engineering Applications." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1229459765.

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

Djang, Claire. "Two-Coloring Cycles In Complete Graphs." Oberlin College Honors Theses / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1370618319.

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

Clark, David. "Algebraic Analysis of Vertex-Distinguishing Edge-Colorings." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/1053.

Full text
Abstract:
Vertex-distinguishing edge-colorings (vdec colorings) are a restriction of proper edge-colorings. These special colorings require that the sets of edge colors incident to every vertex be distinct. This is a relatively new field of study. We present a survey of known results concerning vdec colorings. We also define a new matrix which may be used to study vdec colorings, and examine its properties. We find several bounds on the eigenvalues of this matrix, as well as results concerning its determinant, and other properties. We finish by examining related topics and open problems.
APA, Harvard, Vancouver, ISO, and other styles
44

HIRATA, Tomio, Takao ONO, and Xuzhen XIE. "On Approximation Algorithms for Coloring k-Colorable Graphs." Institute of Electronics, Information and Communication Engineers, 2003. http://hdl.handle.net/2237/15063.

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

Jaeger, Robert. "Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles." VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3816.

Full text
Abstract:
The famous Four Color Theorem states that any planar graph can be properly colored using at most four colors. However, if we want to properly color the square of a planar graph (or alternatively, color the graph using distinct colors on vertices at distance up to two from each other), we will always require at least \Delta + 1 colors, where \Delta is the maximum degree in the graph. For all \Delta, Wegner constructed planar graphs (even without 3-cycles) that require about \frac{3}{2} \Delta colors for such a coloring. To prove a stronger upper bound, we consider only planar graphs that contai
APA, Harvard, Vancouver, ISO, and other styles
46

Legrand-Duchesne, Clément. "Exploration de l'espace des colorations d'un graphe." Electronic Thesis or Diss., Bordeaux, 2024. http://www.theses.fr/2024BORD0117.

Full text
Abstract:
Cette thèse porte sur la reconfiguration combinatoire et des problèmes structurels avec une coloration géométrique. La reconfiguration est l’étude des espaces de configuration vis-à-vis d’une opération élémentaire transformant une configuration en une autre. Les espaces de configuration sont modélisés par des graphes de reconfiguration, dont les sommets sont les configurations et dans lesquels deux configurations sont adjacentes si elles diffèrent par une opération élémentaire. La reconfiguration est motivée par des applications pratiques en mécanique statistique et soulève des questions struc
APA, Harvard, Vancouver, ISO, and other styles
47

Bonamy, Marthe. "Global discharging methods for coloring problems in graphs." Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS261.

Full text
Abstract:
Cette thèse s'inscrit dans le cadre de la théorie des graphes, et porte plus particulièrement sur des problèmes de coloration de graphes. Dans cette thèse, nous nous intéressons à l'utilisation et au développement de la méthode de déchargement, un argument de comptage qui exploite fortement la structure du graphe. Cette méthode est décisive dans la preuve du Théorème des Quatre Couleurs. Nous donnons d'abord une vue d'ensemble des outils de déchargement que nous utilisons dans ce travail, entre les méthodes élégantes mises en application, et les astuces développées. Dans le cadre de la colorat
APA, Harvard, Vancouver, ISO, and other styles
48

Zickfeld, Florian. "On the structure of counterexamples to the coloring conjecture of Hajós." Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-05202004-142057/unrestricted/zickfeld%5Fflorian%5F200407%5Fmast.pdf.

Full text
Abstract:
Thesis (M.S.)--School of Mathematics, Georgia Institute of Technology, 2005. Directed by Xingxing Yu.<br>Xingxing Yu, Committee Chair ; Robin Thomas, Committee Member ; Prasad Tetali, Committee Member ; Anurag Singh, Committee Member. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
49

Raman, Rajiv. "Chromatic scheduling." Diss., University of Iowa, 2007. http://ir.uiowa.edu/etd/156.

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

Moura, Phablo Fernando Soares. "Graph colorings and digraph subdivisions." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/.

Full text
Abstract:
The vertex coloring problem is a classic problem in graph theory that asks for a partition of the vertex set into a minimum number of stable sets. This thesis presents our studies on three vertex (re)coloring problems on graphs and on a problem related to a long-standing conjecture on subdivision of digraphs. Firstly, we address the convex recoloring problem in which an arbitrarily colored graph G is given and one wishes to find a minimum weight recoloring such that each color class induces a connected subgraph of G. We show inapproximability results, introduce an integer linear programming (I
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Coloring graph' for other source types:
Journal articles 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