Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks

n

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

Similar content being viewed by others

From Colourful to Rainbow Paths in Graphs: Colouring the Vertices

Article 08 May 2021

Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes

Article 28 November 2016

Connected Colourings of Complete Graphs and Hypergraphs

Article 19 February 2015

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: March 1999

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

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