483 search results - page 7 / 97 » On perfectness of sums of graphs |
ESA
2004
Springer
14 years 26 days ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
SIAMDM
2010
13 years 5 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
COMBINATORICS
2002
13 years 7 months ago
2002
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum...
DM
2002
13 years 7 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...