Relevant bibliographies by topics / Coloring graph

Contents

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

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Coloring graph"

1

Slilaty, Daniel. "Coloring permutation-gain graphs." Contributions to Discrete Mathematics 16, no. 1 (2021): 47–52. http://dx.doi.org/10.55016/ojs/cdm.v16i1.62717.

Full text
Abstract:
Correspondence colorings of graphs were introduced in 2018 by Dvořák and Postle as a generalization of list colorings of graphs which generalizes ordinary graph coloring. Kim and Ozeki observed that correspondence colorings generalize various notions of signed-graph colorings which again generalizes ordinary graph colorings. In this note we state how correspondence colorings generalize Zaslavsky's notion of gain-graph colorings and then formulate a new coloring theory of permutation-gain graphs that sits between gain-graph coloring and correspondence colorings. Like Zaslavsky's gain-graph colo
APA, Harvard, Vancouver, ISO, and other styles
2

Ei, Ei Moe. "Application of Vertex Colorings with Some Interesting Graphs." International Journal of Trend in Scientific Research and Development 3, no. 6 (2019): 991–96. https://doi.org/10.5281/zenodo.3589203.

Full text
Abstract:
Firstly, basic concepts of graph and vertex colorings are introduced. Then, some interesting graphs with vertex colorings are presented. A vertex coloring of graph G is an assignment of colors to the vertices of G. And then by using proper vertex coloring, some interesting graphs are described. By using some applications of vertex colorings, two problems is presented interestingly. The vertex coloring is the starting point of graph coloring. The chromatic number for some interesting graphs and some results are studied. Ei Ei Moe "Application of Vertex Colorings with Some Interesting Graph
APA, Harvard, Vancouver, ISO, and other styles
3

R. Sudhakar. "Equitable Total Coloring of Line Graph of Certain Graphs." Communications on Applied Nonlinear Analysis 32, no. 9s (2025): 2370–79. https://doi.org/10.52783/cana.v32.4524.

Full text
Abstract:
An equitable total-coloring of a graph G is a proper total-coloring such that the number of vertices and edges in any two color classes differ by at most one. In this paper, we determined the equitable total chromatic number for line graph of ladder, slanting ladder, triangular snake, alternate triangular snake, quadrilateral snake and alternate quadrilateral snake Introduction: Graph coloring is a fundamental problem in graph theory with applications in scheduling, networking, and resource allocation. A total-coloring of a graph G is an assignment of colors to both vertices and edges such tha
APA, Harvard, Vancouver, ISO, and other styles
4

Prajnanaswaroopa, Shantharam, Jayabalan Geetha, Kanagasabapathi Somasundaram, and Teerapong Suksumran. "Total Coloring of Some Classes of Cayley Graphs on Non-Abelian Groups." Symmetry 14, no. 10 (2022): 2173. http://dx.doi.org/10.3390/sym14102173.

Full text
Abstract:
Total Coloring of a graph G is a type of graph coloring in which any two adjacent vertices, an edge, and its incident vertices or any two adjacent edges do not receive the same color. The minimum number of colors required for the total coloring of a graph is called the total chromatic number of the graph, denoted by χ″(G). Mehdi Behzad and Vadim Vizing simultaneously worked on the total colorings and proposed the Total Coloring Conjecture (TCC). The conjecture states that the maximum number of colors required in a total coloring is Δ(G)+2, where Δ(G) is the maximum degree of the graph G. Graph
APA, Harvard, Vancouver, ISO, and other styles
5

Rupam, Shrivastava, and Dr. Satish Agnihotri Prof. "A Study on the Total Coloring and Equitable Total Coloring for Splitting Graph." International Journal of Contemporary Research in Multidisciplinary 3, no. 5 (2024): 137–42. https://doi.org/10.5281/zenodo.13862782.

Full text
Abstract:
This study focuses on the total coloring and equitable total coloring of splitting graphs, an area of graph theory that examines the assignment of colors to both vertices and edges under specific constraints. Total coloring involves assigning distinct colors to adjacent or incident elements (vertices and edges) in such a way that no two adjacent or incident elements share the same color. Equitable total coloring further requires the distribution of colors across vertices and edges to be as balanced as possible. The splitting graph, derived from a base graph by splitting its vertices, presents
APA, Harvard, Vancouver, ISO, and other styles
6

Bagheri Gh., Behrooz, and Behnaz Omoomi. "On the simultaneous edge coloring of graphs." Discrete Mathematics, Algorithms and Applications 06, no. 04 (2014): 1450049. http://dx.doi.org/10.1142/s1793830914500499.

Full text
Abstract:
A μ-simultaneous edge coloring of graph G is a set of μ proper edge colorings of G with a same color set such that for each vertex, the sets of colors appearing on the edges incident to that vertex are the same in each coloring and no edge receives the same color in any two colorings. The μ-simultaneous edge coloring of bipartite graphs has a close relation with μ-way Latin trades. Mahdian et al. (2000) conjectured that every bridgeless bipartite graph is 2-simultaneous edge colorable. Luo et al. (2004) showed that every bipartite graphic sequence S with all its elements greater than one, has
APA, Harvard, Vancouver, ISO, and other styles
7

Erzurumluoğlu, Aras, and C. A. Rodger. "On Evenly-Equitable, Balanced Edge-Colorings and Related Notions." International Journal of Combinatorics 2015 (March 4, 2015): 1–7. http://dx.doi.org/10.1155/2015/201427.

Full text
Abstract:
A graph G is said to be even if all vertices of G have even degree. Given a k-edge-coloring of a graph G, for each color i∈Zk={0,1,…,k-1} let G(i) denote the spanning subgraph of G in which the edge-set contains precisely the edges colored i. A k-edge-coloring of G is said to be an even k-edge-coloring if for each color i∈Zk, G(i) is an even graph. A k-edge-coloring of G is said to be evenly-equitable if for each color i∈Zk, G(i) is an even graph, and for each vertex v∈V(G) and for any pair of colors i,j∈Zk, |degG(i)(v)-degG(j)(v)|∈{0,2}. For any pair of vertices {v,w} let mG({v,w}) be the num
APA, Harvard, Vancouver, ISO, and other styles
8

Abhishek, Kumar. "Strongly set-colorable graphs." Discrete Mathematics, Algorithms and Applications 11, no. 01 (2019): 1950007. http://dx.doi.org/10.1142/s1793830919500071.

Full text
Abstract:
In [S. M. Hegde, Set colorings of graphs, European J. Combin. 30 (2009) 986–995.] Hegde introduced the notion of set colorings of a graph [Formula: see text] as an assignment of distinct subsets of a finite set [Formula: see text] of [Formula: see text] colors to the vertices of [Formula: see text] such that all the colors of the edges which are obtained as the symmetric differences of the subsets assigned to their end-vertices are distinct. Additionally, if all the sets on the vertices and edges of [Formula: see text] are the set of all nonempty subsets of [Formula: see text] then the colorin
APA, Harvard, Vancouver, ISO, and other styles
9

Nuroeni, Ilmiatun, Arika Indah Kristiana, Saddam Hussen, Susi Setiawani, and Robiatul Adawiyah. "LOCAL IRREGULARITY POINT COLORING ON THE RESULT OF SUBDIVISION OPERATION OF HELM GRAPHS." Jurnal Diferensial 5, no. 2 (2023): 117–25. http://dx.doi.org/10.35508/jd.v5i2.12197.

Full text
Abstract:
One of the sub-chapters studied in graphs is local irregularity vertex coloring of graph. The based on definition of local irregularity vertex coloring of graph, as follow : (i)l : V (G) →{1, 2, 3, . . . , k} as a vertex irregular labeling and w : V (G) → N, for every uv ∈ E(G), w(u) ̸=w(v) with w(u) = Pv∈N(u)l(v) and (i) Opt(l) = min{max(li); li is a vertex irregular labeling}. The chromatic number of the local irregularity vertex coloring of G denoted by χlis(G), is the minimum cardinality of the largest label over all such local irregularity vertex colorings. In this article, discuss about
APA, Harvard, Vancouver, ISO, and other styles
10

Ma, Baolin, and Chao Yang. "Distinguishing colorings of graphs and their subgraphs." AIMS Mathematics 8, no. 11 (2023): 26561–73. http://dx.doi.org/10.3934/math.20231357.

Full text
Abstract:
<abstract><p>In this paper, several distinguishing colorings of graphs are studied, such as vertex distinguishing proper edge coloring, adjacent vertex distinguishing proper edge coloring, vertex distinguishing proper total coloring, adjacent vertex distinguishing proper total coloring. Finally, some related chromatic numbers are determined, especially the comparison of the correlation chromatic numbers between the original graph and the subgraphs are obtained.</p></abstract>
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Coloring graph"

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
More sources

Books on the topic "Coloring graph"

1

Jensen, Tommy R. Graph coloring problems. Wiley, 1995.

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

Jensen, Tommy R. Graph coloring problems. Wiley, 1995.

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

Chartrand, Gary. Chromatic graph theory. Chapman & Hall/CRC, 2009.

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

de, Werra D., and Hertz A, eds. Graph colouring and variations. North-Holland, 1989.

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

Barenboim, Leonid, and Michael Elkin. Distributed Graph Coloring. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-031-02009-4.

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

Jensen, Tommy R., and Bjarne Toft. Graph Coloring Problems. John Wiley & Sons, Inc., 1994. http://dx.doi.org/10.1002/9781118032497.

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

Plumettaz, Matthieu. Graph Structure and Coloring. [publisher not identified], 2014.

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

Stiebitz, Michael. Graph edge coloring: Vizing's theorem and Goldberg's conjecture. Wiley, 2012.

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

Workshop on Cycles and Colourings (6th 1997 Stará Lesná, Slovakia). Cycles and colourings '97: Proceedings of the 6th Workshop on Cycles and Colourings, Stará Lesná, September 7-12, 1997. Edited by Harant Jochen. Mathematical Institute, Slovak Academy of Sciences, 1999.

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

Yap, H. P. Total colourings of graphs. Springer, 1996.

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

Book chapters on the topic "Coloring graph"

1

Matsui, Yasuko, and Shin-Ichi Nakano. "Cost Graph Colorings." In Algorithmic Foundations for Social Advancement. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-0668-9_22.

Full text
Abstract:
Abstract Graph colorings are ubiquitous in the modeling of real-world problems. There are many applications and conjectures, which are still open and studied by various mathematicians and computer scientists. In this paper, we deal with cost graph colorings as an important subfield of graph colorings. In cost graph coloring, each color has a distinct cost, and we need to pay the cost each time to color each vertex or edge. Our task is to find a coloring with the minimum total cost. The cost coloring problems are NP-hard in general; however, polynomial time algorithms are known for certain clas
APA, Harvard, Vancouver, ISO, and other styles
2

Xu, Jin. "Kempe Change." In Maximal Planar Graph Theory and the Four-Color Conjecture. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-4745-3_9.

Full text
Abstract:
Abstract The Kempe change is the essence of the Kempe’s “proof” of the Four Color Conjecture (Kempe, Am. J. Math. 2(3), 193–200 (1879)), by which a new 4-coloring of a maximal planar graph can be generated from a given 4-coloring. The fundamental reason why it fails to prove the Four Color Conjecture by using this technique is that there exist many maximal planar graphs G such that the set of all 4-colorings of G can not be generated by applying Kempe change from any given 4-colorings of G. Nevertheless, due to the NP-completeness of the vertex coloring of graphs, Kempe change has been a funda
APA, Harvard, Vancouver, ISO, and other styles
3

Clerc, Maurice. "A Few Applications." In Graph Coloring. CRC Press, 2024. http://dx.doi.org/10.1201/9781003477785-2.

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

Clerc, Maurice. "Encoding." In Graph Coloring. CRC Press, 2024. http://dx.doi.org/10.1201/9781003477785-3.

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

Clerc, Maurice. "A Quantum Method." In Graph Coloring. CRC Press, 2024. http://dx.doi.org/10.1201/9781003477785-6.

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

Clerc, Maurice. "Diplomatic Algorithms." In Graph Coloring. CRC Press, 2024. http://dx.doi.org/10.1201/9781003477785-7.

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

Clerc, Maurice. "Stochastic Methods." In Graph Coloring. CRC Press, 2024. http://dx.doi.org/10.1201/9781003477785-5.

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

Clerc, Maurice. "Deterministic Resolutions." In Graph Coloring. CRC Press, 2024. http://dx.doi.org/10.1201/9781003477785-4.

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

Clerc, Maurice. "Games." In Graph Coloring. CRC Press, 2024. http://dx.doi.org/10.1201/9781003477785-1.

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

Saoub, Karin R. "Graph Coloring." In Graph Theory. Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781138361416-6.

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

Conference papers on the topic "Coloring graph"

1

Faria, Luerbio, Mauro Nigro, and Diana Sasaki. "On the conformable colorings of k-regular graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/etc.2023.230063.

Full text
Abstract:
In 1988, Chetwynd and Hilton defined conformable vertex colorings when trying to characterize the vertex colorings induced by a (∆ + 1)-total coloring. Anticonformable colorings were used to characterize the subcubic conformable graphs. A graph G is anticonformable if it has a (∆ + 1)-vertex coloring such that the number of color classes (including empty color classes) with the same parity as |V| is at most def(G) = ∑v∈V (∆− dG(v)). The only connected subcubic not anticonformable graph is the triangular prism graph L3. In this paper, we prove that if k is even, then every k-regular graph is no
APA, Harvard, Vancouver, ISO, and other styles
2

Adauto, Matheus N., Celina M. H. de Figueiredo, and Diana Sasaki. "Three Questions about Equitable Total Coloring of Small Cubic Graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.222596.

Full text
Abstract:
A total coloring assigns colors to the vertices and edges of a graph without conflicts and it is called equitable if the cardinalities of any two color classes differ by at most 1. In 2020, Stemock considered equitable total colorings of small cubic graphs and conjectured that every 4-total coloring of a cubic graph with less than 20 vertices is equitable. We present counterexamples to Stemock’s conjecture. We determine that every 4-total coloring must be equitable on all cubic graphs with 6, 8, 10, and 14 vertices. On the other hand, for cubic graphs with 12, 16, and 18 vertices, we character
APA, Harvard, Vancouver, ISO, and other styles
3

Hebrard, Emmanuel, and George Katsirelos. "Clause Learning and New Bounds for Graph Coloring." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/856.

Full text
Abstract:
Graph coloring is a major component of numerous allocation and scheduling problems. We introduce a hybrid CP/SAT approach to graph coloring based on exploring Zykov’s tree: for two non-neighbors, either they take a different color and there might as well be an edge between them, or they take the same color and we might as well merge them. Branching on whether two neighbors get the same color yields a symmetry-free tree with complete graphs as leaves, which correspond to colorings of the original graph. We introduce a new lower bound for this problem based on Mycielskian graphs; a method to pro
APA, Harvard, Vancouver, ISO, and other styles
4

Domingues, Kenny, and Ana Silva. "On the Partial Grundy Number of a Graph Minus a Matching." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.223134.

Full text
Abstract:
Given a k-coloring S1, . . . , Sk of G, a vertex in Si is said to be greedy if it has neighbors in Sj, for every j &lt; i. Thus, a Grundy coloring can be seen as a coloring where every vertex is greedy. In contrast, a partial Grundy coloring is defined as a coloring in which each color class has at least one greedy vertex; the maximum number of colors in a partial Grundy coloring is denoted by ∂Γ(G). In this paper, we investigate some conjectures about Grundy colorings, already known not to hold, adapted to partial Grundy colorings. We prove that, while two of them also do not hold, a third do
APA, Harvard, Vancouver, ISO, and other styles
5

Cruz, Mariana M. F. da, Celina M. H. de Figueiredo, Diana Sasaki, and Diane Castonguay. "On total coloring of small fullerene nanodiscs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/etc.2023.230129.

Full text
Abstract:
We investigate the total coloring of fullerene nanodiscs, a subclass of cubic planar graphs with girth 5 arising in Chemistry, motivated by a conjecture about the nonexistence of a Type 2 cubic graph of girth at least 5. We prove an auxiliary lemma which says that every central layer of a fullerene nanodisc is 4-total colorable, a necessary condition for the nanodisc to be Type 1, and we contribute by giving 4-total colorings for small fullerene nanodiscs, showing that these graphs are Type 1.
APA, Harvard, Vancouver, ISO, and other styles
6

Streicher, Simon, and Johan du Preez. "Graph Coloring." In the ACM Multimedia 2017 Workshop. ACM Press, 2017. http://dx.doi.org/10.1145/3132711.3132717.

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

Atici, Mustafa. "Graph coloring." In the 49th Annual Southeast Regional Conference. ACM Press, 2011. http://dx.doi.org/10.1145/2016039.2016082.

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

Andrade, Davi de, and Ana Silva. "(Sub)Fall Coloring and B-Coloring Parameterized by Treewidth." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.222982.

Full text
Abstract:
Given a proper coloring f of G, a vertex u is a b-vertex if it is adjacent to every color class distinct from its own. It is said to be a b-coloring if each color class contains at least one b-vertex, and a fall coloring if all vertices are b-vertices. Also, if f is a fall coloring of an induced subgraph H of G, then we say that f is a subfall coloring of G. In this paper, we provide algorithms for each of the decision problems related to these colorings whose running times are FPT when parameterized by the number of colors plus the treewidth of the input graph.
APA, Harvard, Vancouver, ISO, and other styles
9

De Loera, Jesús A., Susan Margulies, Michael Pernpeintner, et al. "Graph-Coloring Ideals." In ISSAC'15: International Symposium on Symbolic and Algebraic Computation. ACM, 2015. http://dx.doi.org/10.1145/2755996.2756639.

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

Flin, Maxime, Magnús M. Halldórsson, and Alexandre Nolin. "Decentralized Distributed Graph Coloring: Cluster Graphs." In PODC '25: ACM Symposium on Principles of Distributed Computing. ACM, 2025. https://doi.org/10.1145/3732772.3733549.

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

Reports on the topic "Coloring graph"

1

Jin, Zheming. Experience of Migrating Parallel Graph Coloring from CUDA to SYCL. Office of Scientific and Technical Information (OSTI), 2022. http://dx.doi.org/10.2172/1864412.

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

Jin, Zheming. Experience of Migrating Parallel Graph Coloring from CUDA to SYCL. Office of Scientific and Technical Information (OSTI), 2022. http://dx.doi.org/10.2172/1864412.

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

Jones, M. T., and P. E. Plassmann. Parallel iterative solution of sparse linear systems using orderings from graph coloring heuristics. Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/10148824.

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

Wan, Wei. A New Approach to the Decomposition of Incompletely Specified Functions Based on Graph Coloring and Local Transformation and Its Application to FPGA Mapping. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.6582.

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

Rodger, C. A., D. G. Hoffman, P. D. Johnson, and Jr. Connectivity and Colorings of Graphs. Defense Technical Information Center, 2002. http://dx.doi.org/10.21236/ada400177.

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

Rosenfeld, A. ARC Colorings, Partial Path Groups, and Parallel Graph Contractions. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada158918.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Coloring graph' 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