
Finding Efficient Domination for S_1,1,5Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
read it

Finding Efficient Domination for P_8Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
read it

Openindependent, openlocatingdominating sets: structural aspects of some classes of graphs
Let G=(V(G),E(G)) be a finite simple undirected graph with vertex set V(...
read it

On the Bipartiteness Constant and Expansion of Cayley Graphs
Let G be a finite, undirected dregular graph and A(G) its normalized ad...
read it

FPRAS via MCMC where it mixes torpidly (and very little effort)
Is Fully Polynomialtime Randomized Approximation Scheme (FPRAS) for a p...
read it

Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
We investigate the parameterized complexity of finding subgraphs with he...
read it

Bipartite EnvyFree Matching
Bipartite EnvyFree Matching (BEFM) is a relaxation of perfect matching....
read it
Finding Efficient Domination for S_1,3,3Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating set (e.d.s. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s. in G, is complete for various Hfree bipartite graphs, e.g., Lu and Tang showed that ED is complete for chordal bipartite graphs and for planar bipartite graphs; actually, ED is complete even for planar bipartite graphs with vertex degree at most 3 and girth at least g for every fixed g. Thus, ED is complete for K_1,4free bipartite graphs and for C_4free bipartite graphs. In this paper, we show that ED can be solved in polynomial time for S_1,3,3free bipartite graphs.
READ FULL TEXT
Comments
There are no comments yet.