677 search results - page 79 / 136 » Bipartite roots of graphs |
SIROCCO
2008
14 years 17 days 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...
COMBINATORICA
2010
13 years 8 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 ...
DAM
2008
13 years 11 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 ...
GC
2008
Springer
13 years 11 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
IWPEC
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...