Results 51 to 60 of about 8,657,296 (197)
The Chromatic Number of a Signed Graph [PDF]
The Electronic Journal of Combinatorics, 2016 In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph $G$ as a mapping $\phi\colon V(G)\to \mathbb{Z}$ such that for any two adjacent vertices $u$ and $v$ the colour $\phi(u)$ is different from the colour $\sigma(uv)\phi(v)$, where is $\sigma(uv)$ is the sign of the edge $uv$.
Edita Mácajová +2 more
openaire +3 more sources
Chromatic roots are dense in the whole complex plane [PDF]
, 2004 I show that the zeros of the chromatic polynomials P-G(q) for the generalized theta graphs Theta((s.p)) are taken together, dense in the whole complex plane with the possible exception of the disc \q - l\ < l.
Sokal, AD
core
On the total chromatic edge stability number and the total chromatic subdivision number of graphs [PDF]
Discrete Mathematics Letters, 2022 Arnfried Kemnitz, Massimiliano Marangio
doaj +1 more source
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS [PDF]
Journal of Algebraic Systems, 2020 A {it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G) rightarrow {1,2,ldots , |E(G)|}$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $omega _{f}(u) neq omega _{f}(v ...
S. Shaebani
doaj +1 more source
, 2020 Let us say a graph G has "tree-chromatic number" at most k if it admits a tree-decomposition (T, (X t : t ∈ V (T ))) such that G[X t ] has chromatic number at most k for each t ∈ V (T ).
Paul Seymour
core
The Locating Chromatic Number for Pizza Graphs [PDF]
, 2023 The location chromatic number for a graph is an extension of the concepts of partition dimension and vertex coloring in a graph. The minimum number of colors required to perform location coloring in graph G is referred to as the location chromatic number
Nasution, Hamidah +3 more
core +1 more source
Chromatic numbers of spheres [PDF]
Discrete Mathematics, 2018 The chromatic number of a subset of Euclidean space is the minimal number of colors sufficient for coloring all points of this subset in such a way that any two points at the distance 1 have different colors. We give new upper bounds for chromatic numbers of spheres.
openaire +3 more sources
The b-Chromatic Number of Star Graph Families
Le Matematiche, 2010 In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph of star graph, denoted by C(K1,n), M(K1,n) and T(K1,n) respectively.
Vivin J. Vernold, M. Venkatachalam
doaj
The Locating-Chromatic Number of Origami Graphs
Algorithms, 2021 The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by χL(G).
Agus Irawan +3 more
doaj +1 more source
On the Quantum Chromatic Number of a Graph [PDF]
The Electronic Journal of Combinatorics, 2007 We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a referee that they have a colouring of the graph.After discussing this notion from first principles, we go on to establish relations with the clique number and orthogonal ...
Peter J. Cameron +4 more
openaire +4 more sources