scientific article
From MaRDI portal
Publication:3312272
zbMath0531.05047MaRDI QIDQ3312272
N. M. Kornienko, V. N. Zemlyachenko, Regina I. Tyshkevich
Publication date: 1982
Full work available at URL: https://eudml.org/doc/67385
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items (12)
On computation complexity problems concerning relation algebras ⋮ Asymptotic Delsarte cliques in distance-regular graphs ⋮ The QAP-polytope and the graph isomorphism problem ⋮ The isomorphism problem for classes of graphs closed under contraction ⋮ Spectrally Robust Graph Isomorphism ⋮ Polynomial-time algorithm for isomorphism of graphs with clique-width at most three ⋮ An optimal lower bound on the number of variables for graph identification ⋮ Colored hypergraph isomorphism is fixed parameter tractable ⋮ Graph isomorphism and equality of simplices ⋮ Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2 ⋮ Graph isomorphism problem and \(2\)-closed permutation groups ⋮ Finding fixed point free elements and small bases in permutation groups
This page was built for publication:
