scientific article; zbMATH DE number 2086379

MaRDI QIDQ4736833zbMATH OpenFDO

Authors Johannes Köbler, Jacobo Torán

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850121.htm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Completeness results for graph isomorphism.
• On Hypergraph and Graph Isomorphism with Bounded Color Classes
• Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
• scientific article; zbMATH DE number 3815
• scientific article; zbMATH DE number 512806

Cited in

(6)

• Completeness results for graph isomorphism.
• Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
• Colored hypergraph isomorphism is fixed parameter tractable
• scientific article; zbMATH DE number 3815 (Why is no real title available?)
• On Hypergraph and Graph Isomorphism with Bounded Color Classes
• Graph isomorphism restricted by lists

This page was built for publication:

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