Results 41 to 50 of about 12,413 (296)
M_{2}-edge colorings of dense graphs [PDF]
Opuscula Mathematica, 2016 An edge coloring \(\varphi\) of a graph \(G\) is called an \(\mathrm{M}_i\)-edge coloring if \(|\varphi(v)|\leq i\) for every vertex \(v\) of \(G\), where \(\varphi(v)\) is the set of colors of edges incident with \(v\).
Jaroslav Ivančo
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2008 Abstract A split graph is a graph whose vertex set admits a partition into a stable set and a clique. The chromatic indexes for some subsets of split graphs, such as split graphs with odd maximum degree and split-indifference graphs, are known. However, for the general class, the problem remains unsolved.
S. M. ALMEIDA +2 more
openaire +3 more sources
Algorithmica, 2016 A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to at least one vertex in each other color class. The b-chromatic number of $G$ is the maximum integer $b(G)$ for which $G$ has a b-coloring with $b(G)$ colors.
Victor Campos, FERREIRA DA SILVA A
openaire +2 more sources
Acyclicity in edge-colored graphs
Discrete Mathematics, 2017 A walk $W$ in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in $W$ is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type $i$ is a proper superset of graphs of acyclicity of type $i+1$, $i=1,2,3,4.$ The first three types are ...
Gregory Z. Gutin +4 more
openaire +2 more sources
A note on edge colorings and trees
Mathematical Logic Quarterly, 2022 AbstractWe point out some connections between existence of homogenous sets for certain edge colorings and existence of branches in certain trees. As a consequence, we get that any locally additive coloring (a notion introduced in the paper) of a cardinal κ has a homogeneous set of size κ provided that the number of colors μ satisfies .
Adi Jarden, Ziv Shami
openaire +2 more sources
A note on M_{2}-edge colorings of graphs [PDF]
Opuscula Mathematica, 2015 An edge coloring \(\varphi\) of a graph \(G\) is called an \(M_2\)-edge coloring if \(|\varphi(v)|\le2 \) for every vertex \(v\) of \(G\), where \(\varphi(v)\) is the set of colors of edges incident with \(v\). Let \(K_2(G)\) denote the maximum number of
Július Czap
doaj +1 more source
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +1 more source
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling
Algorithms, 2019 For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications.
Qinghai Li, Chang Wu Yu
doaj +1 more source
Smarandachely Adjacent Vertex Distinguishing Edge Coloring Algorithm of Graphs [PDF]
Jisuanji gongcheng, 2017 To solve the problem of Smarandachely Adjacent Vertex Distinguishing Edge Coloring(SAVDEC) of graphs,this paper presents a coloring algorithm based on multi-objective optimization.For each sub problem,the sub objective function vector and decision space ...
CAO Daotong,LI Jingwen,WEN Fei
doaj +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source