496 search results - page 62 / 100 » C4-saturated bipartite graphs |
141
click to vote
SIROCCO
2008
15 years 7 months ago
2008
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
201
click to vote
COMBINATORICA
2010
15 years 3 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
181
click to vote
DAM
2008
15 years 6 months ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
150
click to vote
TC
1998
15 years 5 months ago
1998
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
108
click to vote
DM
2000
15 years 6 months ago
2000
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...