98 search results - page 13 / 20 » Planar Cycle Covering Graphs |
LMCS
2006
13 years 7 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
DAM
2008
13 years 7 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
MFCS
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
IJAC
2010
13 years 4 months ago
2010
Let C(T) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T) be a natural quotient of C(T), and if C(T) is...
WADS
2001
Springer
13 years 12 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...