Results 51 to 60 of about 33,621 (316)

Vertex coloring of plane graphs with nonrepetitive boundary paths

, 2011
A sequence $s_1,s_2,...,s_k,s_1,s_2,...,s_k$ is a repetition. A sequence $S$ is nonrepetitive, if no subsequence of consecutive terms of $S$ form a repetition. Let $G$ be a vertex colored graph.
Alon, Barát, Barát, Brešar, Currie, Grytczuk, Harant, Havet, Kündgen, Mohar, Sanders, Thue, Yu   +12 more
core   +1 more source

The Intersection of Two Vertex Coloring Problems [PDF]

Graphs and Combinatorics, 2019
A hole is an induced cycle with at least four vertices. A hole is even if its number of vertices is even. Given a set L of graphs, a graph G is L-free if G does not contain any graph in L as an induced subgraph. Currently, the following two problems are unresolved: the complexity of coloring even hole-free graphs, and the complexity of coloring {4K1 ...
Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia   +4 more
openaire   +3 more sources

LOCAL IRREGULARITY VERTEX COLORING OF BICYCLIC GRAPH FAMILIES

Barekeng
The graph in this research is a simple and connected graph with  as vertex set and  as an edge set. We used deductive axiomatic and pattern recognition method.
Arika Indah Kristiana, Aji Mansur Santoso, Saddam Hussen, Edy Wihardjo, Robiatul Adawiyah, Dafik Dafik   +5 more
doaj   +1 more source

Vertex colorings without isolates

Journal of Combinatorial Theory, Series B, 1979
AbstractCall a vertex of a vertex-colored simple graph isolated if all its neighbors have colors other than its own. A. J. Goldman has asked: When is it possible to color b vertices of a graph black and the remaining w vertices white so that no vertex is isolated?
openaire   +2 more sources

On Twin Edge Colorings of Graphs

Discussiones Mathematicae Graph Theory, 2014
A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring.
Andrews Eric, Helenius Laars, Johnston Daniel, VerWys Jonathon, Zhang Ping   +4 more
doaj   +1 more source

A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4

Discussiones Mathematicae Graph Theory, 2020
In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex.
Giaro Krzysztof, Kubale Marek
doaj   +1 more source

Upper and lower bounds based on linear programming for the b-coloring problem

EURO Journal on Computational Optimization, 2022
B-coloring is a problem in graph theory. It can model some real applications, as well as being used to enhance solution methods for the classical graph coloring problem. In turn, improved solutions for the classical coloring problem would impact a larger
Roberto Montemanni, Xiaochen Chou, Derek H. Smith   +2 more
doaj   +1 more source

Interval total colorings of graphs

, 2003
A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color.
A Prouté, C Hertling, C Hertling, D Quillen, JD Stasheff, JD Stasheff, M Gerstenhaber, M Markl, M Markl, S Barannikov, S Gelfand, SA Merkulov, SA Merkulov, V Ginzburg, V Hinich, WG Dwyer, WM Goldman, YI Manin   +17 more
core   +3 more sources

Berberine–cinnamic acid co‐crystal effect in ameliorating hyperlipidemia might be regulated through the PI3K/AKT/mTOR/SREBP‐1 signaling pathway

FEBS Open Bio, EarlyView.
Berberine–cinnamic acid co‐crystal (BBR‐CA) inhibits the phosphorylation of the phosphatidylinositol 3‐kinase (PI3K)/AKT/mammalian target of rapamycin (mTOR) pathway, suppressing the transfer of pre‐sterol regulatory element‐binding proteins‐1 (SREBP‐1) from the endoplasmic reticulum to the nucleus. This results in a decrease in the expression level of
Wenheng Gao, Yunlong Li, Lihua Chen, Wenshuo Yang, Yong He, Ye Yang, Dengke Yin, Song Tan   +7 more
wiley   +1 more source

Inclusive Local Irregularity Vertex Coloring In Grid Graph Family

Cauchy: Jurnal Matematika Murni dan Aplikasi
Let  is a simple graph and connected where  is vertex set and  is edge set. A maping  as vertex k- labeling and function :  is inclusive local irregularity vertex coloring, with .
Arika Indah Kristiana, Alvian Bagus Agatha, Saddam Hussen, Rafiantika Megahnia Prihandini, Ridho Alfarisi, M. Kamran Siddiqui   +5 more
doaj   +1 more source