Skip to main content
SpringerLink
Log in

Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and 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

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930050059

Search

Navigation