Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks

Combinatorica volume 19, pages321–333(1999)Cite this article

n

-vertex edge coloured graphs with multiplicity of Jordan blocks bounded by k can be done in time .

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

Author information

Affiliations

  1. St. Petersburg Institute for Informatics and Automation, Academy of Sciences of Russia; E-mail: evdokim@pdmi.ras.ru, RU

    Sergei Evdokimov

  2. St. Petersburg Department of Mathematical Institute, Academy of Sciences of Russia; E-mail: inp@pdmi.ras.ru, RU

    Ilia Ponomarenko

Authors
  1. Sergei Evdokimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ilia Ponomarenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: November 29, 1994

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Evdokimov, S., Ponomarenko, I. Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks. Combinatorica 19, 321–333 (1999). https://doi.org/10.1007/s004930050059

Download citation

  • AMS Subject Classification (1991) Classes:  05C60, 05C85, 05B30