Graph isomorphism completeness for perfect graphs and subclasses of perfect graphs

zbMATH Open1132.05041MaRDI QIDQ5443237FDOQ5443237

Authors:

Publication date: 20 February 2008

Recommendations

• Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
• scientific article; zbMATH DE number 4156494
• On the Hardness of Graph Isomorphism
• Completeness results for graph isomorphism.
• Logical Approaches to Computational Barriers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Perfect graphs (05C17)

Cited In (4)

• The Graphs with All Subgraphs T-Perfect
• Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
• Title not available (Why is that?)
• Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

This page was built for publication: Graph isomorphism completeness for perfect graphs and subclasses of perfect graphs

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