Results 41 to 50 of about 8,657,296 (197)
Chromatic numbers and products
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dwight Duffus, Norbert W. Sauer
openaire +3 more sources
The incidence game chromatic number [PDF]
, 2009 We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph.
Andres, Dominique +1 more
core +1 more source
Monotone Chromatic Number of Graphs
International Journal of Analysis and Applications, 2020 For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors).
Anwar Saleh +3 more
doaj
Local total anti-magic chromatic number of graphs
Heliyon, 2023 Let G=(V,E) be a graph without isolated vertices and let |V(G)|=n and |E(G)|=m. A bijection π:V(G)∪E(G)→{1,2,....,n+m} is said to be local total anti-magic labeling of a graph G if it satisfies the conditions: (i.) for any edge uv, ω(u)≠ω(v), where u and
V. Sandhiya, M. Nalliah
doaj +1 more source
On the Strong Chromatic Number of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2006 The strong chromatic number, $χ_S(G)$, of an $n$-vertex graph $G$ is the smallest number $k$ such that after adding $k\lceil n/k\rceil-n$ isolated vertices to $G$ and considering {\bf any} partition of the vertices of the resulting graph into disjoint subsets $V_1, \ldots, V_{\lceil n/k\rceil}$ of size $k$ each, one can find a proper $k$-vertex ...
Maria Axenovich, Ryan R. Martin
openaire +2 more sources
Circular chromatic number a survey [PDF]
, 2001 The circular chromatic number χc(G) of a graph G (also known as ‘the star-chromatic number’), is a natural generalization of the chromatic number of a graph.
Xuding Zhu, Zhu, Xuding
core +1 more source
On chromatic number and minimum cut [PDF]
Journal of Combinatorial Theory, Series B, 2019 For a graph $G$, the tree graph ${\cal T}_{G,t}$ has all tree subgraphs of $G$ with $t$ vertices as vertex set and two tree subgraphs are neighbors if they are edge-disjoint. Also, the $r^{th}$ cut number of $G$ is the minimum number of edges between parts of a partition of vertex set of $G$ into two parts such that each part has size at least $r$.
Meysam Alishahi, Hossein Hajiabolhassan
openaire +2 more sources
Weighted graphs: Eigenvalues and chromatic number
Electronic Journal of Graph Theory and Applications, 2016 We revisit Hoffman relation involving chromatic number $\chi$ and eigenvalues. We construct some graphs and weighted graphs such that the largest and smallest eigenvalues $\lambda$ dan $\mu$ satisfy $\lambda=(1-\chi)\mu.$ We study in particular the ...
Charles Delorme
doaj +1 more source
Algebraic Properties of Chromatic Polynomials and Their Roots [PDF]
, 2015 In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We relate algebraic properties of chromatic polynomials of graphs to structural properties of those graphs for some simple families of graphs.
Gilmore, Hamish Julian
core
The Locating Chromatic Number of Book Graph
Journal of Mathematics, 2021 Let G=VG,EG be a connected graph and c:VG⟶1,2,…,k be a proper k-coloring of G. Let Π be a partition of vertices of G induced by the coloring c. We define the color code cΠv of a vertex v∈VG as an ordered k-tuple that contains the distance between each ...
Nur Inayah +2 more
doaj +1 more source