488 search results - page 15 / 98 » Automorphic Decompositions of Graphs |
CSR
2007
Springer
15 years 3 months ago
2007
Springer
139
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
138
click to vote
DM
1999
15 years 3 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
126
Voted
CSL
2005
Springer
15 years 9 months ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
129
Voted
IPL
2010
15 years 1 months ago
2010
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...