Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A decidability algorithm for strongly asymmetric graphs

From MaRDI portal
Publication:2754528
Jump to:navigation, search

zbMATH Open0989.05117MaRDI QIDQ2754528

Moise Cocan

Publication date: 11 November 2001





zbMATH Keywords

decidability algorithmstrongly asymmetric graphs


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)



Related Items (2)

On strongly asymmetric graphs ⋮ On a class of strongly asymmetric PKA algorithms






This page was built for publication: A decidability algorithm for strongly asymmetric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754528)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2754528&oldid=15629407"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 15:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki