779 search results - page 1 / 156 » A graph polynomial for independent sets of bipartite graphs |
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
DAM
2008
13 years 5 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
IPL
2010
13 years 2 months ago
2010
Polynomial algorithms are given for the following two problems:
WG
2007
Springer
13 years 11 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
IV
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...