488 search results - page 9 / 98 » Automorphic Decompositions of Graphs |
DM
2007
13 years 7 months ago
2007
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.
GD
2006
Springer
13 years 11 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
COMBINATORICS
2004
13 years 7 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
COMBINATORICS
2006
13 years 7 months ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
DM
2008
13 years 7 months ago
2008
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...