ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Technology
Mathematics
Research
Agronomy and forestry
Computing
Chemistry
Biology
Pure sciences
Economy
Environment
all records (67)

Languages
English
German
Portuguese
Spanish
French

Countries
Indonesia
USA
Australia
Switzerland
Ukraine
Brazil
Italy
Romania
South Africa
India
all records (70)

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

Filter  
 
2.368  Articles
1 of 238 pages  |  10  records  |  more records»
A symmetric triple-hyperstar is a connected, 3-uniform hypergraph where, for some edge {a, b, c}, vertices a, b, and c all have degree k > 1 and all other edges contain exactly 2 vertices of degree 1. Let H denote the symmetric... see more

In 2007 Matamala proved that if G is a simple graph with maximum degree ? = 3 not containing K?+1 as a subgraph and s, t are positive integers such that s+t = ?, then the vertex set of G admits a partition (S,T) such that G[S] is a maximum order (s-1... see more

The traveling salesperson problem (TSP) is a very well-known NP-hard combinatorial optimization problem. Many different integer programming formulations are known for the TSP. Some of them are “compact”, in the sense of having a polynomially-bounded numbe... 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

A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge is completely colored by a single color. We present a complete algebraic characterization of the 2-colorability of r-uniform hypergraphs. This generalizes ... 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

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 238 pages  |  10  records  |  more records»