Constrained path-finding and structure from acyclicity

01/21/2019
by   Lê Thành Dũng Nguyên, et al.
0

This note presents several results in graph theory inspired by the author's work in the proof theory of linear logic; these results are purely combinatorial and do not involve logic. We show that trails avoiding forbidden transitions and rainbow paths for complete multipartite color classes can be found in linear time, whereas finding rainbow paths is NP-complete for any other restriction on color classes. For the tractable cases, we also state new structural properties equivalent to Kotzig's theorem on bridges in unique perfect matchings. We also exhibit a connection between blossoms and bridge deletion orders in unique perfect matchings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2019

Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix

This paper establishes a bridge between linear logic and mainstream grap...
research
08/15/2019

Tracking Paths in Planar Graphs

We consider the NP-complete problem of tracking paths in a graph, first ...
research
11/09/2017

A Proof of Stavi's Theorem

Kamp's theorem established the expressive equivalence of the temporal lo...
research
07/13/2023

(k-2)-linear connected components in hypergraphs of rank k

We define a q-linear path in a hypergraph H as a sequence (e_1,…,e_L) of...
research
04/02/2021

Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths

In this note, we present constructive bijections from Dyck and Motzkin m...
research
06/26/2020

Computing all s-t bridges and articulation points simplified

Given a directed graph G and a pair of nodes s and t, an s-t bridge of G...
research
10/15/2017

The Complete Extensions do not form a Complete Semilattice

In his seminal paper that inaugurated abstract argumentation, Dung prove...

Please sign up or login with your details

Forgot password? Click here to reset