Results 111 to 120 of about 82,445 (208)

Brain Tumor Segmentation Using Graph Coloring Approach in Magnetic Resonance Images. [PDF]

J Med Signals Sens, 2021
Bagheri R, Monfared JH, Montazeriyoun MR.   +2 more
europepmc   +1 more source

Monotonic Stable Solutions for Minimum Coloring Games [PDF]

For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)).
Hamers, H.J.M., Miquel, S., Norde, H.W.
core   +1 more source

Colored Homomorphisms of Colored Mixed Graphs

Journal of Combinatorial Theory, Series B, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
André Raspaud, Jaroslav Nešetřil
openaire   +3 more sources

List T-colorings of graphs

Discrete Applied Mathematics, 1993
Given a set \(T\) and an integer \(k\), a graph \(G\) is \(T-k\) choosable if, for every assignment of (possibly different) lists of \(k\) integers to the vertices of \(G\), there exists a \(T\)-colouring of \(G\) colouring each vertex with an element from the list assigned to that vertex.
openaire   +2 more sources

Even triangulations of 𝑆³ and the coloring of graphs [PDF]

, 1978
Jacob E. Goodman, Hironori Onishi
openalex   +1 more source

Demonstrating b-coloring of generalized Jahangir graphs for representing complex manufacturing process

Cogent Engineering
A graph’s b-coloring admits proper coloring and has the extra characteristic of having a dominating node in each color-class in the graph. [Formula: see text] the b-chromatic number, is the largest integer k for which G can be colored with k colors using
Foram Chandarana, Minal. S. Shukla, Amit Sata, Ram Subbiah, Saurav Dixit, Rajesh Mahadeva   +5 more
doaj   +1 more source

Algorithms for edge coloring bipartite graphs [PDF]

, 1978
Harold N. Gabow, Oded Kariv
openalex   +1 more source

Efficient and Robust Graph Coloring Algorithm for Graph Coloring Problem: Malatya Vertex Coloring Algorithm

IEEE Access
The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color.
Selman Yakut
doaj   +1 more source

RGB Color Cluster and Graph Coloring Algorithm for Partial Color Blind Correction

MATEC Web of Conferences, 2019
Partial color blindness is an anomaly occurring to 5-8% of the world's population. Color correction using re-coloring algorithm usually can be used to help partial color blindness patient.
Dody Qori Utama, Tati Latifah R. Mengko, Richard Mengko, Andika Prahasta Gandasubrata, Tauhid Nur Azhar   +4 more
doaj   +1 more source

Interval Incidence Coloring of Subcubic Graphs

Discussiones Mathematicae Graph Theory, 2017
In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is NP-complete, and ...
Małafiejska Anna, Małafiejski Michał
doaj   +1 more source