Results 71 to 80 of about 20,911 (165)
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Modular chromatic number of $C_m square P_n$ [PDF]
Transactions on Combinatorics, 2013 A modular $k$-coloring, $kge 2,$ of a graph $G$ without isolated vertices is a coloring of the vertices of $G$ with the elements in $mathbb{Z}_k$ having the property that for every two adjacent vertices of $G,$ the sums of the colors of the neighbors are
N. Paramaguru, R. Sampathkumar
doaj
Discrete Mathematics, 1994 From the article: ``Taking the colors to be the positive integers, the greedy vertex-coloring algorithm can be described as follows. The vertices of a graph \(G\) are ordered and the algorithm assigns colors to the vertices in that order, giving each vertex the first ...
openaire +1 more source
Chromatic numbers of algebraic hypergraphs [PDF]
Combinatorica, 2016 A k-uniform hypergraph is algebraic if its vertex set is n-dimensional Euclidean space, for some n, and its hyperedge set is defined from the zero set of some polynomial. The chromatic numbers of all algebraic hypergraphs are determined, provided they are infinite.
openaire +2 more sources
Chromatic Number of Resultant of Fuzzy Graphs
Fuzzy Information and Engineering, 2016 Fuzzy graph coloring techniques are used to solve many complex real world problems. The chromatic number of complement of fuzzy graph is obtained and compared with the chromatic number of the corresponding fuzzy graph.
Anjaly Kishore, M.S. Sunitha
doaj +1 more source
Asteroidal Chromatic Number of a Graph
Electronic Notes in Discrete Mathematics, 2003 Summary: Let \(G=(V,E)\) be a connected graph. A subset \(A\) of \(V\) is called an asteroidal set if for any three vertices \(u,v,w\) in \(A\), there exists a \(u\)-\(v\) path in \(G\) that avoids the neighbourhood of \(w\). The asteroidal chromatic number \(\chi_a\) of \(G\) is the minimum order of a partition of \(V\) into asteroidal sets.
S. Arumugam 0001, Hepzibai Jeyakumar
openaire +2 more sources
The incidence chromatic number of some graph
International Journal of Mathematics and Mathematical Sciences, 2005 The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with Δ(G)+2 colors.
Liu Xikui, Li Yan
doaj +1 more source
Zero Knowledge and the Chromatic Number
Journal of Computer and System Sciences, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uriel Feige, Joe Kilian
openaire +2 more sources
Graphs obtained from collections of blocks
Electronic Journal of Graph Theory and Applications, 2015 Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially ...
Colton Magnant +2 more
doaj +1 more source
Matlab algorithms for traffic light assignment using fuzzy graph, fuzzy chromatic number, and fuzzy inference system. [PDF]
MethodsX, 2020 Rosyida I, Nurhaida, Narendra A, Widodo.
europepmc +1 more source