Search for a unique incidence matrix of a graph

DOI10.1007/BF01932948MaRDI QIDQ4770988zbMATH OpenOpenAlexFDO

Authors Andrzej Proskurowski

Publication date 1974

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01932948

Mathematics Subject Classification ID

Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites work

• scientific article; zbMATH DE number 3166587 (Why is no real title available?)
• A Backtrack Procedure for Isomorphism of Directed Graphs
• An Efficient Algorithm for Graph Isomorphism
• An algorithm for determining the automorphism partitioning of an undirected graph
• Depth-First Search and Linear Graph Algorithms
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

Cited in

(3)

• Canonical incidence matrices of graphs
• Algorithms for finding directed graph isomorphisms by finite automata
• A new algorithm for digraph isomorphism

This page was built for publication: Search for a unique incidence matrix of a graph

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