ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Social Sciences
Research
Economy
Law
Literature
Religion
Technology
History
Languages
all records (74)

Languages
English
Portuguese
Spanish
German
French

Countries
Indonesia
Brazil
USA
South Africa
Spain
Cuba
Germany
Ukraine
Poland
Chile
all records (79)

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

Filter  
 
158.215  Articles
1 of 15.823 pages  |  10  records  |  more records»
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

Intersecting and cross-intersecting families usually appear in extremal combinatorics in the vein of the Erdos-Ko-Rado theorem. On the other hand, P. Erdos and L. Lovász in their noted 1975 paper posed problems on coloring intersecting families ... see more

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

We develop a connection between DP-colorings of kk-uniform hypergraphs of order nn and coverings of nn-dimensional Boolean hypercube by pairs of antipodal (n-k)(n-k)-dimensional faces. Bernshteyn and Kostochka established a lower bound on the number of ed... 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 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

The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets. We introduce an abstract version of a framework by Smorodinsky and Yuditsky, used for polychromatic col... see more

The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets. We introduce an abstract version of a framework by Smorodinsky and Yuditsky, used for polychromatic col... see more

The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets. We introduce an abstract version of a framework by Smorodinsky and Yuditsky, used for polychromatic col... see more

1 of 15.823 pages  |  10  records  |  more records»