R. Rabinovich

activity

20112026

most citedOn the Generalised Colouring Numbers of Graphs that Exclude a Fixed Minor

8 citations · 39 across the 15 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2022★ 2 cited

The treewidth and pathwidth of graph unions

Bogdan Alecu, Vadim Lozin, Daniel A. Quiroz +3

Given two $n$ -vertex graphs $G_{1}$ and $G_{2}$ of bounded treewidth, is there an $n$ -vertex graph $G$ of bounded treewidth having subgraphs isomorphic to $G_{1}$ and $G_{2}$ ? Our main res…

math.CO2019

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs

Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht

A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based…

math.CO2016★ 8 cited

On the Generalised Colouring Numbers of Graphs that Exclude a Fixed Minor

Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz +2

The generalised colouring numbers $col_{r} (G)$ and $wcol_{r} (G)$ were introduced by Kierstead and Yang as a generalisation of the usual colouring number, and have sin…