Sciweavers

48 search results - page 1 / 10
» Total interval numbers of complete r-partite graphs
Sort
View
DAM
2002
54views more  DAM 2002»
13 years 10 months ago
Total interval numbers of complete r-partite graphs
Mingjang Chen, Gerard J. Chang
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
Pinar Heggernes, Daniel Meister, Yngve Villanger
GD
2005
Springer
14 years 4 months ago
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 10 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
JGT
2011
109views more  JGT 2011»
13 years 5 months ago
Total weight choosability of graphs
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
Tsai-Lien Wong, Xuding Zhu