2283 search results - page 18 / 457 » Bounds of Graph Characteristics |
JGT
2007
13 years 7 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
SIAMDM
2010
13 years 2 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
WG
2005
Springer
14 years 1 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
GD
2006
Springer
13 years 11 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...