Decomposition of (infinite) digraphs along directed 1-separations

05/16/2023
by   Nathan Bowler, et al.
0

We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the structure of finite and infinite directed graphs with respect to their 1-separations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2020

Edge-connectivity and tree-structure in finite and infinite graphs

We show that every graph admits a canonical tree-like decomposition into...
research
12/14/2022

Unfoldings and coverings of weighted graphs

Coverings of undirected graphs are used in distributed computing, and un...
research
10/16/2022

A Note On ℓ-Rauzy Graphs for the Infinite Fibonacci Word

The ℓ-Rauzy graph of order k for any infinite word is a directed graph i...
research
02/04/2019

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

A connected graph G is called matching covered if every edge of G is con...
research
12/14/2021

Modeling Advection on Directed Graphs using Matérn Gaussian Processes for Traffic Flow

The transport of traffic flow can be modeled by the advection equation. ...
research
06/20/2022

Guided structure learning of DAGs for count data

In this paper, we tackle structure learning of Directed Acyclic Graphs (...
research
06/18/2020

Local structure of idempotent algebras II

In this paper we continue the study of edge-colored graphs associated wi...

Please sign up or login with your details

Forgot password? Click here to reset