Nestedness has been observed in a variety of networks but has been primarily viewed in the
context of bipartite networks. Numerous metrics quantify nestedness and some clustering …

In this article, we present various algorithms to partition the nodes of a network into groups
that show the property of nestedness. Since perfect nestedness is a rare phenomenon, we …

We propose an edge-based community detection algorithm that finds nested communities of
a given graph. The communities are defined as the subgraphs induced by the edges of the …

We study the problem of partitioning the edge set of a graph into bipartite subgraphs under
certain constraints defined by forbidden subgraphs. These constraints lead to both classical …

A k-linear coloring of a graph G is an edge coloring of G with k colors so that each color
class forms a linear forest—a forest whose each connected component is a path. The linear …