Results 11 to 20 of about 33,621 (316)
Vertex-Coloring with Star-Defects [PDF]
, 2016 Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure. Due to its important applications, as for example in the bipartisation of graphs, this type of coloring has been ...
Patrizio Angelini +3 more
openalex +5 more sources
On vertex coloring without monochromatic triangles [PDF]
, 2017 We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles.
B Courcelle +14 more
core +2 more sources
On the Path-Avoidance Vertex-Coloring Game [PDF]
Electronic Notes in Discrete Mathematics, 2011 For any graph $F$ and any integer $r\geq 2$, the online vertex-Ramsey density of $F$ and $r$, denoted $m^*(F,r)$, is a parameter defined via a deterministic two-player Ramsey-type game (Painter vs. Builder). This parameter was introduced in a recent paper [arXiv:1103.5849], where it was shown that the online vertex-Ramsey density determines the ...
Torsten Mütze, Reto Spöhel
+8 more sources
Journal of Graph Algorithms and Applications, 2017 Defective coloring is a variant of the traditional vertex-coloring in which adjacent vertices are allowed to have the same color, as long as the induced monochromatic components have a certain structure. Due to its important applications, as for example in the bipartisation of graphs, this type of coloring has been extensively studied, mainly with ...
Patrizio Angelini +9 more
openalex +4 more sources
On the complexity of vertex-coloring edge-weightings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and Algorithms Given a graph G = (V; E) and a weight function omega : E -\textgreater R, a coloring of vertices of G, induced by omega, is defined by chi(omega) (nu) = Sigma(e(sic)nu) omega (e) for all nu is an element of V. In this paper, we show that determining whether a particular graph has a weighting of the edges from \1, 2\ that
Andrzej Dudek, David Wajc
openalex +4 more sources
on Graceful Chromatic Number of Vertex amalgamation of Tree Graph Family
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2022 Proper vertex coloring c of a graph G is a graceful coloring if c is a graceful k-coloring for k∈{1,2,3,…}. Definition graceful k-coloring of a graph G=(V,E) is a proper vertex coloring c:V(G)→{1,2,…,k);k≥2, which induces a proper edge coloring c':E(G ...
Arika Indah Kristiana +3 more
doaj +1 more source
PEWARNAAN TITIK TOTAL SUPER ANTI-AJAIB LOKAL PADA GRAF PETERSEN DIPERUMUM P(n,k) DENGAN k=1,2
Barekeng, 2021 The local antimagic total vertex labeling of graph G is a labeling that every vertices and edges label by natural number from 1 to such that every two adjacent vertices has different weights, where is The sum of a vertex label and the labels of all ...
Deddy Setyawan +4 more
doaj +1 more source
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Hasil Operasi Comb Graf Bintang
Contemporary Mathematics and Applications (ConMathA), 2022 Let G(V,E) is a simple graph and connected where V(G) is vertex set and E(G) is edge set. An inclusive local irregularity vertex coloring is defined by a mapping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of inclusive local ...
Arika Indah Kristiana +2 more
doaj +1 more source
A survey on vertex coloring problems [PDF]
International Transactions in Operational Research, 2009 AbstractThis paper surveys the most important algorithmic and computational results on the Vertex Coloring Problem (VCP) and its generalizations. The first part of the paper introduces the classical models for the VCP, and discusses how these models can be used and possibly strengthened to derive exact and heuristic algorithms for the problem ...
Enrico Malaguti, Paolo Toth
openalex +4 more sources
LOCAL IRREGULARITY POINT COLORING ON THE RESULT OF SUBDIVISION OPERATION OF HELM GRAPHS
Jurnal Diferensial, 2023 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) →
Ilmiatun Nuroeni +4 more
doaj +1 more source