Skip to main content
Ctrl+K
NetworkX Notebooks - Home NetworkX Notebooks - Home
  • GitHub
  • Algorithms
    • Node Assortativity Coefficients and Correlation Measures
    • Directed Acyclic Graphs & Topological Sort
    • Dinitz’s Algorithm and Applications
    • Lowest Common Ancestor
    • Euler’s Algorithm
    • Isomorphism
      • Isomorphism - How to find if two graphs are similar?
      • To be or not to be (isomorphic)
  • Applications
    • The Good Will Hunting Problem
    • Networks in Epidemiology: Hantavirus
  • Graph Generators
    • Geometric Generator Models
    • Sudoku and Graph Coloring
  • Facebook Network Analysis
  • Contributors Guide
  • Repository
  • Suggest edit
  • Open issue
  • .md

Isomorphism

Isomorphism#

  • Isomorphism - How to find if two graphs are similar?
    • What is isomorphism? Why is it interesting?
      • Formal definition
      • Applications
    • Isomorphism Algorithms
      • Naive Approach
    • Some classes of graphs with solution in polynomial time
    • Advanced Algorithms
      • VF2
    • State of the art
      • References
  • To be or not to be (isomorphic)
    • Exploring properties on the graph atlas
      • Inspiration

previous

Euler’s Algorithm

next

Isomorphism - How to find if two graphs are similar?

By NetworkX developers

© Copyright 2026, NetworkX developers.