AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if every finite abstract group occurs as the automorphism group of some graph in C, then C contains all finite graphs (up to isomorphism). Also related results concerning automorphism groups of graphs on given surfaces are mentioned
AbstractFor a large class of finite Cayley graphs we construct covering graphs whose automorphism gr...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
AbstractThe power graph of a group is the graph whose vertex set is the group, two elements being ad...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
Given that a large graph admits a group of automorphisms isomorphic to the abstract group G, what is...
A polynomial time isomorphism test for graphs called k-contractible graphs for fixed k is included. ...
Groups of automorphisms of graphs - abstract In this thesis we investigate automorphism groups of se...
AbstractIt is shown that for any given finite permutation group P there exist (infinitely many non-i...
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of ...
Abstract. In this article, we study the outer automorphism group of a group G decomposed as a finite...
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of ...
AbstractEnumerative results are presently a major center of interest in topological graph theory, as...
AbstractAutomorphisms σ of a connected graph X satisfying σ(F) ≠ F for all finite non-empty subsets ...
AbstractSuppose G is a graph without loops or digons and H is a spanning subgraph of G. Let A(G) be ...
AbstractFor a large class of finite Cayley graphs we construct covering graphs whose automorphism gr...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
AbstractThe power graph of a group is the graph whose vertex set is the group, two elements being ad...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
Given that a large graph admits a group of automorphisms isomorphic to the abstract group G, what is...
A polynomial time isomorphism test for graphs called k-contractible graphs for fixed k is included. ...
Groups of automorphisms of graphs - abstract In this thesis we investigate automorphism groups of se...
AbstractIt is shown that for any given finite permutation group P there exist (infinitely many non-i...
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of ...
Abstract. In this article, we study the outer automorphism group of a group G decomposed as a finite...
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of ...
AbstractEnumerative results are presently a major center of interest in topological graph theory, as...
AbstractAutomorphisms σ of a connected graph X satisfying σ(F) ≠ F for all finite non-empty subsets ...
AbstractSuppose G is a graph without loops or digons and H is a spanning subgraph of G. Let A(G) be ...
AbstractFor a large class of finite Cayley graphs we construct covering graphs whose automorphism gr...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
AbstractThe power graph of a group is the graph whose vertex set is the group, two elements being ad...
DOI
Add to ORKG