ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Technology
Mathematics
Social Sciences
Research
Economy
Architecture and Urbanism
Communication
Computing
Literature
all records (75)

Languages
English
Portuguese
Spanish
French
German

Countries
Indonesia
Brazil
USA
Ukraine
South Africa
Australia
Spain
Denmark
Chile
Poland
all records (77)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
175.594  Articles
1 of 17.560 pages  |  10  records  |  more records»
A vi-simultaneous proper k-coloring of a graph G is a coloring of all vertices and incidences of the graph in which any two adjacent or incident elements in the set V(G)?I(G) receive distinct colors, where I(G) is t... see more

Let G be a connected plane graph with vertex set V and edge set E. For X ? {V, E, V ? E}, two elements of X are facially adjacent in G if they are incident elements, adjacent vertices, or facially adjacent edges (edges that are consecutive ... see more

Let c : V(G)?{1, 2, …, k} be a proper k-coloring of a simple connected graph G. Let ? = {C1, C2, …, Ck} be a partition of V(G), where Ci is the set of vertices of G receiving color i. The color c... see more

We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated symmetric function in... see more

One of the fascinating questions of computer science is whether and to what extent randomization increases the power of algorithmic procedures.It is well-known that, in general, randomization makes distributed algorithms more powerful, for there are examp... see more

Let F, G and H be any simple graphs. The notation F ? (G, H) means for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H. If F ? (G, H), then graph... see more

Complex problems that usually occur in every hospital, one of which is scheduling with so many aspects, for example: the number of nurses, the distribution of nurse shifts, time off or leave and others. With the manual method that is still used in compili... see more

Let F, G and H be simple graphs. The notation F ? (G, H) means that for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H. A graph F is called... see more

Abstract: Let the star on n vertices, namely K1, n - 1 be denoted by Sn. If every two coloring of the edges of a complete balanced multipartite graph Kj × s there is a copy of Sn in the first color or a copy of... see more

1 of 17.560 pages  |  10  records  |  more records»