Memory paging for connectivity and path problems in graphs.
Minimal acyclic dominating sets and cut-vertices
The paper studies minimal acyclic dominating sets, acyclic domination number and upper acyclic domination number in graphs having cut-vertices.
Minimal cycle bases of outerplanar graphs.
Minimally n-line connected graphs.
Minimum functors on categories of Neumann trees
Minmax strongly connected subgraphs with node penalties.
More on even [a,b]-factors in graphs
In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a,b]-factor. For general graphs we prove that an a-edge connected graph G with n vertices and with δ(G) ≥ max{a+1,an/(a+b) + a - 2} has an even [a,b]-factor, where a and b are even and 2 ≤ a ≤ b. With regard to the edge-connectivity this result is slightly better than one of the similar results obtained by Kouider and Vestergaard in 2004 and unlike their results, this result has no restriction on the...