3 citations · 9 across the 10 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020★ 2 cited
Classification of Finite Highly Regular Vertex-Coloured Graphs
Irene Heinrich, Thomas Schneider, Pascal Schweitzer
A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism. A coloured graph is t-tuple regular if the…
math.CO2020
Automated Testing and Interactive Construction of Unavoidable Sets for Graph Classes of Small Path-width
Oliver Bachtler, Irene Heinrich
We present an interactive framework that, given a membership test for a graph class and a number , finds and tests unavoidable sets for the class of graphs in $\ma…
math.CO2020
2.5-Connectivity: Unique Components, Critical Graphs, and Applications
Irene Heinrich, Till Heller, Eva Schmidt +1
If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a…