496 search results - page 6 / 100 » C4-saturated bipartite graphs |
LATIN
2000
Springer
15 years 5 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
108
Voted
COCO
2010
Springer
14 years 11 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
115
click to vote
TCS
2010
14 years 8 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
130
Voted
ECCC
2010
14 years 8 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
106
click to vote
DAM
2008
15 years 1 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...