scientific article; zbMATH DE number 6257546
From MaRDI portal
Publication:5747380
zbMath1283.05172arXiv1203.4822MaRDI QIDQ5747380
Andrew R. Curtis, Min Chih Lin, Francisco J. Soulignac, Yahav Nussbaum, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
Publication date: 14 February 2014
Full work available at URL: https://arxiv.org/abs/1203.4822
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Algorithms in computer science (68W99) Graph designs and isomorphic decomposition (05C51)
Related Items (13)
Isomorphism testing for \(T\)-graphs in FPT ⋮ Graph isomorphism for graph classes characterized by two forbidden induced subgraphs ⋮ Solving the canonical representation and star system problems for proper circular-arc graphs in logspace ⋮ Essential obstacles to Helly circular-arc graphs ⋮ Circle graph isomorphism in almost linear time ⋮ On semi-transitive orientability of split graphs ⋮ Towards an isomorphism dichotomy for hereditary graph classes ⋮ Tractabilities and intractabilities on geometric intersection graphs ⋮ Circular-arc hypergraphs: rigidity via connectedness ⋮ On \(H\)-topological intersection graphs ⋮ Canonical representations for circular-arc graphs using flip sets ⋮ On the isomorphism problem for Helly circular-arc graphs ⋮ Cyclic arrangements with minimum modulo \(m\) winding numbers
This page was built for publication:
