The Steiner Multicycle problem consists of, given a complete graph, a we...
In 1996, Matheson and Tarjan proved that every near planar triangulation...
Trees with many leaves have applications on broadcasting, which is a met...
A graph whose nodes have degree 1 or 3 is called a {1,3}-graph. Liu and
...
Broadcasting in a computer network is a method of transferring a message...
Tuza (1981) conjectured that the size τ(G) of a minimum set of edges
tha...
The scissors congruence conjecture for the unimodular group is an analog...
Let (G) be the minimum cardinality of a set of vertices that intersects
...
Minimum k-Section denotes the NP-hard problem to partition the vertex se...
Minimum Bisection denotes the NP-hard problem to partition the vertex se...
We consider a game-theoretical problem called selfish 2-dimensional bin
...