Around and beyond the isomorphism problem for interval graphs

MaRDI QIDQ4584888zbMATH OpenFDO

Authors Sebastian Kuhnert, Oleg Verbitsky, Johannes Köbler

Publication date 4 September 2018

Full work available at URL http://eatcs.org/beatcs/index.php/beatcs/article/view/68/64

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Interval graphs: canonical representation in logspace
• Interval graphs: canonical representations in logspace
• On the isomorphism problem for Helly circular-arc graphs
• Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
• Canonizing Graphs of Bounded Tree Width in Logspace

Cited in

(4)

• On the isomorphism problem for Helly circular-arc graphs
• Interval graphs: canonical representations in logspace
• Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
• Interval graphs: canonical representation in logspace

This page was built for publication: Around and beyond the isomorphism problem for interval graphs

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