11 citations · 23 across the 21 of their papers we have counts for
3 papers · 1 filter
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko +1
The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chor…
Girth, oddness, and colouring defect of snarks
Ján Karabáš, Edita Máčajová, Roman Nedela +1
The colouring defect of a cubic graph, introduced by Steffen in 2015, is the minimum number of edges that are left uncovered by any set of three perfect matchings. Since a cubic gr…
On a representation of the automorphism group of a graph in a unimodular group
István Estelyi, Ján Karabáš, Alexander Mednykh +1
We investigate a representation of the automorphism group of a connected graph in the group of unimodular matrices of dimension , where is the Betti number of grap…