Titlebook: ;

OWL

t families of graphs such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional grids. We also study and give bounds for the star chromatic number of other families of graphs, such as hypercubes, tori, .-dimensional grids, graphs with bounded treewidth and planar graphs.

嫌惡

連鎖,連串

Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs,es all presently known graphs with this property. Our new results are applied to derive best possible edge-isoperimetric inequalities for the cartesian powers of arbitrary regular, resp. regular bipartite, graphs with a high density.

倔強(qiáng)一點

Maximum Clique Transversals,f minimum cardinality. We consider the problem for planar graphs and present fixed parameter and approximation results..We also examine some other graph classes: subclasses of chordal graphs such as k-trees, strongly chordal graphs, etc., graphs with few . ., comparability graphs, and distance hereditary graphs.

冒號

Subdue

eucalyptus

(,+) -Disatance- Herediatry Graphs,.. The class of all these graphs is denoted by DH(., +) By varying the parameter ., classes DH(., +) form a hierarchy that represents a parametric extension of the well-known class of distance-hereditary graphs, and include all graphs.

遺棄

顧客

acrophobia

Small ,-Dominating Sets in Planar Graphs with Applications, = O(1/ε). For several subclasses of planar graphs of diameter ., we show that γ.(.) is bounded by a constant for . ? ./2. We conjecture that the same result holds for every planar graph. This problem is motivated by the design of routing schemes with compact data structures.