Diameter of the inversion graph
F Havet, F Hörsch, C Rambaud - arXiv preprint arXiv:2405.04119, 2024 - arxiv.org
In an oriented graph $\vec {G} $, the inversion of a subset $ X $ of vertices consists in
reversing the orientation of all arcs with both endvertices in $ X $. The inversion graph of a …
reversing the orientation of all arcs with both endvertices in $ X $. The inversion graph of a …
A note on the invertibility of oriented graphs
N Behague, T Johnston, N Morrison… - arXiv preprint arXiv …, 2024 - arxiv.org
For an oriented graph $ D $ and a set $ X\subseteq V (D) $, the inversion of $ X $ in $ D $ is
the graph obtained from $ D $ by reversing the orientation of each edge that has both …
the graph obtained from $ D $ by reversing the orientation of each edge that has both …
Problems from BCC30
PJ Cameron - arXiv preprint arXiv:2409.07216, 2024 - arxiv.org
These problems were mostly presented at the problem session at the 30th British
Combinatorial Conference at Queen Mary University of London on 4 July 2024. Some were …
Combinatorial Conference at Queen Mary University of London on 4 July 2024. Some were …
On tournament inversion
R Yuster - arXiv preprint arXiv:2312.01910, 2023 - arxiv.org
An {\it inversion} of a tournament $ T $ is obtained by reversing the direction of all edges with
both endpoints in some set of vertices. Let ${\rm inv} _k (T) $ be the minimum length of a …
both endpoints in some set of vertices. Let ${\rm inv} _k (T) $ be the minimum length of a …
Inversion Diameter and Treewidth
Y Wang, H Wang, Y Yang, M Lu - arXiv preprint arXiv:2407.15384, 2024 - arxiv.org
In an oriented graph $\overrightarrow {G} $, the inversion of a subset $ X $ of vertices
consists in reversing the orientation of all arcs with both end-vertices in $ X $. The inversion …
consists in reversing the orientation of all arcs with both end-vertices in $ X $. The inversion …
The inversion number of dijoins and blow-up digraphs
H Wang, Y Yang, M Lu - arXiv preprint arXiv:2404.14937, 2024 - arxiv.org
For an oriented graph\(D\), the\emph {inversion} of\(X\subseteq V (D)\) in\(D\) is the digraph
obtained from\(D\) by reversing the direction of all arcs with both ends in\(X\). The\emph …
obtained from\(D\) by reversing the direction of all arcs with both ends in\(X\). The\emph …