Results 81 to 90 of about 82,445 (208)
Discrete Mathematics, 1982 AbstractColoring a signed graph by signed colors, one has a chromatic polynomial with the same enumerative and algebraic properties as for ordinary graphs. New phenomena are the interpretability only of odd arguments and the existence of a second chromatic polynomial counting zero-free colorings. The generalization to voltage graphs is outlined.
openaire +1 more source
Bilangan Kromatik Permainan Graf Ubur-Ubur, Graf Siput, dan Graf Gurita
Jambura Journal of MathematicsGraph coloring is the process of assigning colors to the vertices or edges of a graph. Specifically, coloring the vertices in graph coloring can be implemented in graph coloring games.
M Luthfi Abdurahman +2 more
doaj +1 more source
Jurnal Ilmu Komputer dan Informasi, 2012 University Course Timetabling Problem merupakan proses penjadwalan mata kuliah di sebuah universitas yang hasilnya diusahakan seoptimal mungkin untuk tidak saling berbenturan dengan batasan-batasan dan syarat-syarat (constraints) tertentu.
Lely Hiryanto, Jacklin Sinthia Thio
doaj +1 more source
Conditional colorings of graphs
Discrete Mathematics, 2006 For an integer \(r>0\), a conditional \((k,r)\)-coloring of a graph \(G\) is a proper \(k\)-coloring of the vertices of \(G\) such that every vertex of degree at least \(r\) in \(G\) is adjacent to vertices with at least \(r\) different colors. The smallest integer \(k\) for which a graph \(G\) has a conditional \((k,r)\)-coloring is the \(r\)th order ...
Bruce Montgomery +4 more
openaire +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
Magic Sigma Coloring of a Graph
Computer Science Journal of Moldova, 2021 A sigma coloring of a non-trivial connected graph $G$ is a coloring $c:V(G)\rightarrow\mathbb{N}$ such that $\sigma(u)\ne\sigma(v)$ for every two adjacent vertices $u,v\in V(G)$, where $\sigma(v)$ is the sum of the colors of the vertices in the open ...
Narahari Narasimha Swamy +2 more
doaj
Total Coloring Conjecture for Certain Classes of Graphs
Algorithms, 2018 A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color.
R. Vignesh, J. Geetha, K. Somasundaram
doaj +1 more source
On the colorings of outerplanar graphs
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Drawing Colored Graphs on Colored Points
Theoretical Computer Science, 2007 AbstractLet G be a planar graph with n vertices and with a partition of the vertex set into subsets V0,…,Vk−1 for some positive integer 1≤k≤n. Let S be a set of n distinct points in the plane with a partition into subsets S0,…,Sk−1 with ∣Vi∣=∣Si∣ (0≤i≤k−1).
Badent M. +2 more
openaire +3 more sources
Perfectly colorable graphs [PDF]
Information Processing Letters, 2011 2 pages, 1 ...
openaire +2 more sources