270 search results - page 8 / 54 » Matching graphs of Hypercubes and Complete Bipartite Graphs |
FSTTCS
2007
Springer
15 years 6 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
EJC
2008
14 years 12 months ago
2008
ARSCOM
2004
14 years 11 months ago
2004
JCDCG
2000
Springer
15 years 3 months ago
2000
Springer
DM
2010
14 years 12 months ago
2010
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...