Efficient graph automorphism by vertex partitioning

, , , &
Artificial Intelligence 21 (1-2):245-269 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(83)80012-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
The conjugacy problem for the automorphism group of the random graph.Samuel Coskey, Paul Ellis & Scott Schneider - 2011 - Archive for Mathematical Logic 50 (1-2):215-221.
On the classification of vertex-transitive structures.John Clemens, Samuel Coskey & Stephanie Potter - 2019 - Archive for Mathematical Logic 58 (5-6):565-574.
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem.Ming Leng, Ling-yu Sun & Kai-Qiang Guo - 2017 - Journal of Intelligent Systems 26 (3).
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
Combinatorial mapping-torus, branched surfaces and free group automorphisms.François Gautero - 2007 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 6 (3):405-440.
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
Reverse Mathematics and the Coloring Number of Graphs.Matthew Jura - 2016 - Notre Dame Journal of Formal Logic 57 (1):27-44.
Wild edge colourings of graphs.Mirna Džamonja, Péter Komjáth & Charles Morgan - 2004 - Journal of Symbolic Logic 69 (1):255 - 264.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
On the strength of könig's duality theorem for countable bipartite graphs.Stephen G. Simpson - 1994 - Journal of Symbolic Logic 59 (1):113-123.
Feasible graphs with standard universe.Douglas Cenzer & Jeffrey B. Remmel - 1998 - Annals of Pure and Applied Logic 94 (1-3):21-35.
Symmetries in modal logics.Carlos Areces & Ezequiel Orbe - 2015 - Bulletin of Symbolic Logic 21 (4):373-401.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,627,781)

6 months
3 (#983,674)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references