Results 31 to 40 of about 33,621 (316)

AVD proper edge-coloring of some families of graphs

International Journal of Mathematics for Industry, 2021
Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj   +1 more source

The majority coloring of the join and Cartesian product of some digraph [PDF]

MATEC Web of Conferences, 2022
A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vertices with the same color in the out-neighborhood does not exceed half of its out-degree.
Shi Mei, Xia Weihao, Xiao Mingyue, Wang Jihui   +3 more
doaj   +1 more source

Bounded vertex coloring of trees

Discrete Mathematics, 2001
The \(k\)-bounded chromatic number, \(\chi _{k}(G),\) of a graph \(G\) is the minimum number of colors required to color the vertices of \(G\) such that no two vertices receive the same color and each color is assigned to at most \(k\) vertices. It is shown that \(\chi _{k}(T)\leq \left\lceil n/k\right\rceil +1\) for every tree \(T\). The authors state
Mark Jarvis, Bing Zhou
openaire   +3 more sources

Vertex colorings with a distance restriction

Discrete Mathematics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
András Gyárfás, Guantao Chen, Richard H. Schelp   +2 more
openaire   +3 more sources

Colorful Paths in Vertex Coloring of Graphs [PDF]

The Electronic Journal of Combinatorics, 2011
A colorful path in a graph $G$ is a path with $\chi(G)$ vertices whose colors are different. A $v$-colorful path is such a path, starting from $v$. Let $G\neq C_7$ be a connected graph with maximum degree $\Delta(G)$. We show that there exists a $(\Delta(G)+1)$-coloring of $G$ with a $v$-colorful path for every $v\in V(G)$.
Afshin Nikzad, Vahid Liaghat, Saieed Akbari   +2 more
openaire   +2 more sources

On b-vertex and b-edge critical graphs [PDF]

Opuscula Mathematica, 2015
A \(b\)-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the \(b\)-chromatic number \(b(G)\) of a graph \(G\) is the largest integer \(k\) such that \(G ...
Noureddine Ikhlef Eschouf, Mostafa Blidia   +1 more
doaj   +1 more source

Pewarnaan Titik Ketakteraturan Lokal pada Hasil Operasi Amalgamasi Titik Graf Lintasan

Contemporary Mathematics and Applications (ConMathA), 2023
Definition of graph is set pair (𔑉(𔐺),𔐸(𔐺)) where 𔑉(𔐺) is vertex set and 𔐸(𔐺) is edge set. A maping 𔐼 : 𔑉(𔐺)→{1,2, ... ,𔑘} as label function and weight function 𔑤 : 𔑉(𔐺)→𔑁 is desined as 𔑤(𔑢)=Σ𔑣
Rafelita Faradila Sandi, Arika Indah Kristiana, Lioni Anka Monalisa, Slamin, Robiatul Adawiyah   +4 more
doaj   +1 more source

Finding and Counting Vertex-Colored Subtrees [PDF]

Algorithmica, 2010
Conference version in International Symposium on Mathematical Foundations of Computer Science (MFCS), Brno : Czech Republic (2010) Journal Version in ...
Guillemot, Sylvain, Sikora, Florian
openaire   +7 more sources

Covering complete partite hypergraphs by monochromatic components [PDF]

, 2016
A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formulated by Gy\'arf\'as: if the edges of a complete graph K are colored with ...
Gyárfás, András, Király, Zoltán
core   +2 more sources

Linear colorings of subcubic graphs [PDF]

, 2013
A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths.
Liu, Chun-Hung, Yu, Gexin
core   +3 more sources