Sciweavers

7 search results - page 1 / 2
» Forbidden subgraphs and the existence of a 2-factor
Sort
View
JGT
2010
83views more  JGT 2010»
14 years 8 months ago
Forbidden subgraphs and the existence of a 2-factor
In 1996, Ota and Tokuda showed that a star-free graph with sufficiently high minimum degree admits a 2-factor. More recently it was shown that the minimum degree condition can be ...
Robert E. L. Aldred, Jun Fujisawa, Akira Saito
DM
2008
95views more  DM 2008»
14 years 10 months ago
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Mas...
DAM
2008
90views more  DAM 2008»
14 years 10 months ago
Polarity of chordal graphs
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 ...
Tinaz Ekim, Pavol Hell, Juraj Stacho, Dominique de...
ALGORITHMICA
2006
100views more  ALGORITHMICA 2006»
14 years 10 months ago
Error Compensation in Leaf Power Problems
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
DAM
2008
123views more  DAM 2008»
14 years 10 months ago
Polar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...