… In this paper we characterize equistarable bipartite graphs. We show that a bipartite graph
is equistarable if and only if every 2-matching of the graph extends to a matching covering all …

… It is known that the kernel of the incidence matrix of a connected non-bipartite graph G is of
dimension urn:x-wiley:03649024:media:jgt22040:jgt22040-math-0289 (see, eg [10, Corollary …

… Equistarable bipartite graphs Recently, Milanič and Trotignon introduced the class of
equistarable graphs as graphs without isolated vertices admitting positive weights on the edges …

… The graph K3 will be also referred to as the triangle. By Km,n we denote the … bipartite graph
with parts of the bipartition of sizes m and n. The claw is the complete bipartite graph K1,3. …

… The graph K3 will be also referred to as the triangle. By Km,n we denote the … bipartite graph
with parts of the bipartition of sizes m and n. The claw is the complete bipartite graph K1,3. …

… line graphs of balanced complete bipartite graphs, and graphs in which every maximal clique
is simplicial, that is, it consists of a vertex and all its neighbors. However, for general graphs…

… the n-vertex complete graph, path, and cycle, respectively, and by Km,n the complete bipartite
graph with parts of sizes m and n. The degree of a vertex v in a graph G is denoted by dG(v…

… of graphs, namely two classes of split graphs, a class of bipartite graphs, and a class of
cobipartite graphs… of the corresponding graphs and give rise to new classes of graphs of bounded …