In 1973, Fisk proved that any 4-coloring of a 3-colorable triangulation
...
In this paper, we consider a transformation of k disjoint paths in a gra...
We consider the problem of determining whether a target item assignment ...
We consider the problem of reforming an envy-free matching when each age...
We initiate the study of k-edge-connected orientations of undirected gra...
The minimum leaf number ml (G) of a connected graph G is
defined as the ...
Given a multigraph, suppose that each vertex is given a local assignment...