ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Research
Biology
Library and Museology
Computing
Education
Architecture and Urbanism
Pure sciences
all records (73)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
USA
Brazil
Denmark
Australia
Ukraine
Italy
Canada
Chile
Spain
all records (75)

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

Filter  
 
4.473  Articles
1 of 448 pages  |  10  records  |  more records»
Let k = 2 be an integer and G be a connected graph of order at least 3. A twin k-edge coloring of G is a proper edge coloring of G that uses colors from Zk and that induces a proper vertex colori... see more

A proper edge coloring of a class 2 graph G is minimal if it contains a color class of cardinality equal to the resistance r(G) of G, which is the minimum number of edges that have to be removed from G to obtain a graph which is ?(G)-edge colorable, ... see more

Suppose G(V,E) be a connected simple graph and suppose u,v,x be vertices of graph G. A bijection f : V ? E ? {1,2,3,...,|V (G)| + |E(G)|} is called super local edge antimagic total labeling if for any adjacent edges uv and vx, w(uv) 6= w(vx), wh... see more

A star edge coloring of a graph G is a proper edge coloring without bichromatic paths and cycles of length four. In this paper, we obtain the star edge chromatic number of the corona product of path with cycle, path with wheel, path with helm and path wit... see more

In this paper, a new concept of fuzzy edge coloring is introduced. The fuzzy edge coloring is an assignment of colors to edges of a fuzzy graph G. It is proper if no two strong adjacent edges of G will receive the same color. Fuzzy edge chromatic number o... see more

The edge-distinguishing chromatic number (EDCN) of a graph G is the minimum positive integer k such that there exists a vertex coloring c : V(G)?{1, 2, …, k} whose induced edge labels {c(u),c(v)} are distinct for al... see more

We consider the question of when a triangulation with a Grünbaum coloring can be edge-colored with three colors such that the non-facial 3-cycles also receive all three colors; we will call this a strong Grünbaum coloring. It turns out that for the s... see more

Let G be a connected and edge-colored graph of order n, where adjacent edges may be colored the same. A tree in G is a rainbow tree if all of its edges have distinct colors. Let k be an integer with 2 = k = n. The m... see more

In the academic environment there are various problems, one of problem is scheduling of courses at the university level. These problems are affected by the allocation of time (Conformity of SKS with each course), the availability of classrooms, and many s... see more

1 of 448 pages  |  10  records  |  more records»