488 search results - page 11 / 98 » Automorphic Decompositions of Graphs |
DM
2007
13 years 7 months ago
2007
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
EJC
2007
13 years 7 months ago
2007
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
IWOCA
2009
Springer
14 years 5 days ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
WG
1998
Springer
13 years 11 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....