Relevant bibliographies by topics / Maximum Edge Coloring (Graphs)

Contents

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

Academic literature on the topic 'Maximum Edge Coloring (Graphs)'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 September 2023

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 'Maximum Edge Coloring (Graphs).'

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 "Maximum Edge Coloring (Graphs)"

1

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
2

HUC, FLORIAN. "WEIGHTED-EDGE-COLORING OF k-DEGENERATE GRAPHS AND BIN-PACKING." Journal of Interconnection Networks 12, no. 01n02 (2011): 109–24. http://dx.doi.org/10.1142/s0219265911002861.

Full text
Abstract:
The weighted-edge-coloring problem of an edge-weighted graph whose weights are between 0 and 1, consists in finding a coloring using as few colors as possible and satisfying the following constraints: the sum of weights of edges with the same color and incident to the same vertex must be at most 1. In 1991, Chung and Ross conjectured that if G is bipartite, then [Formula: see text] colors are always sufficient to weighted-edge-color (G,w), where [Formula: see text] is the maximum of the sums of the weights of the edges incident to a vertex. We prove this is true for edge-weighted graphs with m
APA, Harvard, Vancouver, ISO, and other styles
3

Obata, Yuji, and Takao Nishizeki. "Generalized edge-colorings of weighted graphs." Discrete Mathematics, Algorithms and Applications 08, no. 01 (2016): 1650015. http://dx.doi.org/10.1142/s1793830916500154.

Full text
Abstract:
Let [Formula: see text] be a graph with a positive integer weight [Formula: see text] for each vertex [Formula: see text]. One wishes to assign each edge [Formula: see text] of [Formula: see text] a positive integer [Formula: see text] as a color so that [Formula: see text] for any vertex [Formula: see text] and any two edges [Formula: see text] and [Formula: see text] incident to [Formula: see text]. Such an assignment [Formula: see text] is called an [Formula: see text]-edge-coloring of [Formula: see text], and the maximum integer assigned to edges is called the span of [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
4

Jin, Zemin, Kun Ye, He Chen, and Yuefang Sun. "Large rainbow matchings in semi-strong edge-colorings of graphs." Discrete Mathematics, Algorithms and Applications 10, no. 02 (2018): 1850021. http://dx.doi.org/10.1142/s1793830918500210.

Full text
Abstract:
The lower bounds for the size of maximum rainbow matching in properly edge-colored graphs have been studied deeply during the last decades. An edge-coloring of a graph [Formula: see text] is called a strong edge-coloring if each path of length at most three is rainbow. Clearly, the strong edge-coloring is a natural generalization of the proper one. Recently, Babu et al. considered the problem in the strongly edge-colored graphs. In this paper, we introduce a semi-strong edge-coloring of graphs and consider the existence of large rainbow matchings in it.
APA, Harvard, Vancouver, ISO, and other styles
5

Huo, Jingjing, Mingchao Li, and Ying Wang. "A Characterization for the Neighbor-Distinguishing Index of Planar Graphs." Symmetry 14, no. 7 (2022): 1289. http://dx.doi.org/10.3390/sym14071289.

Full text
Abstract:
Symmetry, such as structural symmetry, color symmetry and so on, plays an important role in graph coloring. In this paper, we use structural symmetry and color symmetry to study the characterization for the neighbor-distinguishing index of planar graphs. Let G be a simple graph with no isolated edges. The neighbor-distinguishing edge coloring of G is a proper edge coloring of G such that any two adjacent vertices admit different sets consisting of the colors of their incident edges. The neighbor-distinguishing index χa′(G) of G is the smallest number of colors in such an edge coloring of G. It
APA, Harvard, Vancouver, ISO, and other styles
6

SKULRATTANAKULCHAI, SAN, and HAROLD N. GABOW. "COLORING ALGORITHMS ON SUBCUBIC GRAPHS." International Journal of Foundations of Computer Science 15, no. 01 (2004): 21–40. http://dx.doi.org/10.1142/s0129054104002285.

Full text
Abstract:
We present efficient algorithms for three coloring problems on subcubic graphs. (A subcubic graph has maximum degree at most three.) The first algorithm is for 4-edge coloring, or more generally, 4-list-edge coloring. Our algorithm runs in linear time, and appears to be simpler than previous ones. The second algorithm is the first randomized EREW PRAM algorithm for the same problem. It uses O(n/ log n) processors and runs in O( log n) time with high probability, where n is the number of vertices of the graph. The third algorithm is the first linear-time algorithm to 5-total-color subcubic grap
APA, Harvard, Vancouver, ISO, and other styles
7

Bu, Yuehua, and Chentao Qi. "Injective edge coloring of sparse graphs." Discrete Mathematics, Algorithms and Applications 10, no. 02 (2018): 1850022. http://dx.doi.org/10.1142/s1793830918500222.

Full text
Abstract:
A [Formula: see text]-injective edge coloring of a graph [Formula: see text] is a coloring [Formula: see text], such that if [Formula: see text], [Formula: see text] and [Formula: see text] are consecutive edges in [Formula: see text], then [Formula: see text]. [Formula: see text] has a [Formula: see text]-injective edge coloring[Formula: see text] is called the injective edge coloring number. In this paper, we consider the upper bound of [Formula: see text] in terms of the maximum average degree mad[Formula: see text], where [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
8

Yin, Huixin, Miaomiao Han, and Murong Xu. "Strong Edge Coloring of K4(t)-Minor Free Graphs." Axioms 12, no. 6 (2023): 556. http://dx.doi.org/10.3390/axioms12060556.

Full text
Abstract:
A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index χs′(G) is the smallest integer l such that G admits a strong edge coloring using l colors. A K4(t)-minor free graph is a graph that does not contain K4(t) as a contraction subgraph, where K4(t) is obtained from a K4 by subdividing edges exactly t−4 times. The paper shows that every K4(t)-minor free graph with maximum degree Δ(G) has χs′(G)≤(t−1)Δ(G) for t∈{5,6,7} which generalizes some known results on K4-minor free gr
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Donghan. "Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ2,1,2". Mathematics 9, № 7 (2021): 708. http://dx.doi.org/10.3390/math9070708.

Full text
Abstract:
A theta graph Θ2,1,2 is a graph obtained by joining two vertices by three internally disjoint paths of lengths 2, 1, and 2. A neighbor sum distinguishing (NSD) total coloring ϕ of G is a proper total coloring of G such that ∑z∈EG(u)∪{u}ϕ(z)≠∑z∈EG(v)∪{v}ϕ(z) for each edge uv∈E(G), where EG(u) denotes the set of edges incident with a vertex u. In 2015, Pilśniak and Woźniak introduced this coloring and conjectured that every graph with maximum degree Δ admits an NSD total (Δ+3)-coloring. In this paper, we show that the listing version of this conjecture holds for any IC-planar graph with maximum
APA, Harvard, Vancouver, ISO, and other styles
10

Liang, Zuosong, and Huandi Wei. "A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs." Computational Intelligence and Neuroscience 2021 (October 5, 2021): 1–5. http://dx.doi.org/10.1155/2021/7667656.

Full text
Abstract:
Every graph G = V , E considered in this paper consists of a finite set V of vertices and a finite set E of edges, together with an incidence function that associates each edge e ∈ E of G with an unordered pair of vertices of G which are called the ends of the edge e . A graph is said to be a planar graph if it can be drawn in the plane so that its edges intersect only at their ends. A proper k -vertex-coloring of a graph G = V , E is a mapping c : V ⟶ S ( S is a set of k colors) such that no two adjacent vertices are assigned the same colors. The famous Four Color Theorem states that a planar
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Maximum Edge Coloring (Graphs)"

1

Hocquard, Hervé. "Colorations de graphes sous contraintes." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2011. http://tel.archives-ouvertes.fr/tel-00987686.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à différentes notions de colorations sous contraintes. Nous nous intéressons plus spécialement à la coloration acyclique, à la coloration forte d'arêtes et à la coloration d'arêtes sommets adjacents distinguants.Dans le Chapitre 2, nous avons étudié la coloration acyclique. Tout d'abord nous avons cherché à borner le nombre chromatique acyclique pour la classe des graphes de degré maximum borné. Ensuite nous nous sommes attardés sur la coloration acyclique par listes. La notion de coloration acyclique par liste des graphes planaires a été introduite par
APA, Harvard, Vancouver, ISO, and other styles
2

Kurt, Oguz. "On The Coloring of Graphs." The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1262287401.

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

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
4

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
5

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
6

Renman, Jonatan. "One-sided interval edge-colorings of bipartite graphs." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-171753.

Full text
Abstract:
A graph is an ordered pair composed by a set of vertices and a set of edges, the latter consisting of unordered pairs of vertices. Two vertices in such a pair are each others neighbors. Two edges are adjacent if they share a common vertex. Denote the amount of edges that share a specific vertex as the degree of the vertex. A proper edge-coloring of a graph is an assignment of colors from some finite set, to the edges of a graph where no two adjacent edges have the same color. A bipartition (X,Y) of a set of vertices V is an ordered pair of two disjoint sets of vertices such that V is the union
APA, Harvard, Vancouver, ISO, and other styles
7

SILVA, ANDERSON GOMES DA. "A STUDY ON EDGE AND TOTAL COLORING OF GRAPHS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=36080@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Uma coloração de arestas é a atribuição de cores às arestas de um grafo, de modo que arestas adjacentes não recebam a mesma cor. O menor inteiro positivo para o qual um grafo admite uma coloração de arestas é dito seu índice cromático. Fizemos revisão bibliográfica dos principais resultados conhecidos nessa área. Uma coloração total, por sua vez, é a aplicação de cores aos vértices e arestas de um grafo de modo que elementos adjacentes ou incidentes recebam cores distintas. O
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

McClain, Christopher. "Edge colorings of graphs and multigraphs." Columbus, Ohio : Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1211904033.

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

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

Books on the topic "Maximum Edge Coloring (Graphs)"

1

1949-, Rödl Vojtěch, Ruciński Andrzej, and Tetali Prasad, eds. A Sharp threshold for random graphs with a monochromatic triangle in every edge coloring. American Mathematical Society, 2006.

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

Book chapters on the topic "Maximum Edge Coloring (Graphs)"

1

Chen, Zhi-Zhong, Sayuri Konno, and Yuki Matsushita. "Approximating Maximum Edge 2-Coloring in Simple Graphs." In Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14355-7_9.

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

Huang, Zhepeng, Long Yuan, Haofei Sui, Zi Chen, Shiyu Yang, and Jianye Yang. "Edge Coloring on Dynamic Graphs." In Database Systems for Advanced Applications. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30675-4_10.

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

Feige, Uriel, Eran Ofek, and Udi Wieder. "Approximating Maximum Edge Coloring in Multigraphs." In Approximation Algorithms for Combinatorial Optimization. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45753-4_11.

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

Lucarelli, Giorgio, Ioannis Milis, and Vangelis Th Paschos. "On the Maximum Edge Coloring Problem." In Approximation and Online Algorithms. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93980-1_22.

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

Soifer, Alexander. "Edge Colored Graphs: Ramsey and Folkman Numbers." In The Mathematical Coloring Book. Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-74642-5_27.

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

Mannino, Carlo, and A. Sassano. "Edge projection and the maximum cardinality stable set problem." In Cliques, Coloring, and Satisfiability. American Mathematical Society, 1996. http://dx.doi.org/10.1090/dimacs/026/11.

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

Jin, Xin, Min Chen, Xinhong Pang, and Jingjing Huo. "Edge-Face List Coloring of Halin Graphs." In Algorithmic Aspects in Information and Management. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-57602-8_43.

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

Bonamy, Marthe, Nicolas Bousquet, and Hervé Hocquard. "Adjacent vertex-distinguishing edge coloring of graphs." In The Seventh European Conference on Combinatorics, Graph Theory and Applications. Scuola Normale Superiore, 2013. http://dx.doi.org/10.1007/978-88-7642-475-5_50.

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

Caragiannis, Ioannis, Christos Kaklamanis, and Pino Persiano. "Edge Coloring of Bipartite Graphs with Constraints." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48340-3_34.

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

Zhou, Xiao, and Takao Nishizeki. "Edge-coloring and f-coloring for various classes of graphs." In Algorithms and Computation. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58325-4_182.

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

Conference papers on the topic "Maximum Edge Coloring (Graphs)"

1

Sobral, Gabriel A. G., Marina Groshaus, and André L. P. Guedes. "Biclique edge-choosability in some classes of graphs∗." In II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3203.

Full text
Abstract:
In this paper we study the problem of coloring the edges of a graph for any k-list assignment such that there is no maximal monochromatic biclique, in other words, the k-biclique edge-choosability problem. We prove that the K3free graphs that are not odd cycles are 2-star edge-choosable, chordal bipartite graphs are 2-biclique edge-choosable and we present a lower bound for the biclique choice index of power of cycles and power of paths. We also provide polynomial algorithms to compute a 2-biclique (star) edge-coloring for K3-free and chordal bipartite graphs for any given 2-list assignment to
APA, Harvard, Vancouver, ISO, and other styles
2

Botler, Fábio, Wanderson Lomenha, and João Pedro de Souza. "On the maximum number of edges in a graph with prescribed walk-nonrepetitive chromatic number." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.222730.

Full text
Abstract:
Fix a coloring c: V(G) → N of the vertices of a graph G and let W=v_1 ... v_{2r} be a walk in G. We say that W is repetitive (with respect to c) if c(v_i) = c(v_{i+r}) for i = 1,..., r; and that W is boring if v_i=v_{i+r}, for every i = 1,...,r. Finally, we say that c is a walk-nonrepetitive coloring of G if every repetitive walk is boring, and we denote by σ(G) the walk-nonrepetitive chromatic number, i.e., the minimum number of colors in a walk-nonrepetitive coloring of G. In this paper we explore the maximum number of edges in a graph G with n vertices for which σ(G) = k, for k≥ 4. In [Bará
APA, Harvard, Vancouver, ISO, and other styles
3

Garvardt, Jaroslav, Niels Grüttemeier, Christian Komusiewicz, and Nils Morawietz. "Parameterized Local Search for Max c-Cut." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/620.

Full text
Abstract:
In the NP-hard Max c-Cut problem, one is given an undirected edge-weighted graph G and wants to color the vertices of G with c colors such that the total weight of edges with distinctly colored endpoints is maximal. The case with c=2 is the famous Max Cut problem. To deal with the NP-hardness of this problem, we study parameterized local search algorithms. More precisely, we study LS-Max c-Cut where we are additionally given a vertex coloring f and an integer k and the task is to find a better coloring f' that differs from f in at most k entries, if such a coloring exists; otherwise, f is k-op
APA, Harvard, Vancouver, ISO, and other styles
4

Peng, Yue. "b-coloring and b-edge coloring of Mesh Graphs and their related graphs." In Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), edited by Shi Jin and Wanyang Dai. SPIE, 2023. http://dx.doi.org/10.1117/12.2672201.

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

Ding, Zhe, Jingwen Li, Rong Luo, and Lijing Zhang. "Adjacent Vertex Reducible Edge Coloring for graphs." In 2022 IEEE 10th Joint International Information Technology and Artificial Intelligence Conference (ITAIC). IEEE, 2022. http://dx.doi.org/10.1109/itaic54216.2022.9836456.

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

Sohaee, Nassim, George Maroulis, and Theodore E. Simos. "Vertex-Edge-Face Coloring of Planar Graphs." In COMPUTATIONAL METHODS IN SCIENCE AND ENGINEERING: Advances in Computational Science: Lectures presented at the International Conference on Computational Methods in Sciences and Engineering 2008 (ICCMSE 2008). AIP, 2009. http://dx.doi.org/10.1063/1.3225458.

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

Li, Jingwen, Zhongfu Zhang, Enqiang Zhu, et al. "Adjacent Vertex Reducible Edge-Total Coloring of Graphs." In 2009 2nd International Conference on Biomedical Engineering and Informatics. IEEE, 2009. http://dx.doi.org/10.1109/bmei.2009.5304740.

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

Hilgemeier, M., N. Drechsler, and R. Drechsler. "Fast heuristics for the edge coloring of large graphs." In Proceedings. Euromicro Symposium on Digital System Design. IEEE, 2003. http://dx.doi.org/10.1109/dsd.2003.1231932.

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

Adawiyah, R., Dafik, I. H. Agustin, A. I. Kristiana, and R. Alfarisi. "Some unicyclic graphs and its vertex coloring edge-weighting." In Proceedings of the 17th International Conference on Ion Sources. Author(s), 2018. http://dx.doi.org/10.1063/1.5054461.

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

Dafik, R. Alfarisi, A. I. Kristiana, R. Adawiyah, and I. H. Agustin. "Vertex coloring edge-weighting of some wheel related of graphs." In INTERNATIONAL CONFERENCE ON SCIENCE AND APPLIED SCIENCE (ICSAS) 2018. Author(s), 2018. http://dx.doi.org/10.1063/1.5054488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Maximum Edge Coloring (Graphs)' for particular source types:
Journal articles Dissertations / Theses
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