On Existence of Must-Include Paths and Cycles in Undirected Graphs

02/19/2023
by   Yefim Dinitz, et al.
0

Given an undirected graph G=(V,E) and vertices s,t,w_1,w_2∈ V, we study finding whether there exists a simple path P from s to t such that w_1,w_2 ∈ P. As a sub-problem, we study the question: given an undirected graph and three of its edges, does there exist a simple cycle containing all those edges? We provide necessary and sufficient conditions for the existence of such paths and cycles, and develop efficient algorithms to solve this and related problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2022

Surjective polymorphisms of reflexive cycles

A reflexive cycle is any reflexive digraph whose underlying undirected g...
research
07/09/2015

The Shadows of a Cycle Cannot All Be Paths

A "shadow" of a subset S of Euclidean space is an orthogonal projection ...
research
03/10/2023

Simple and efficient four-cycle counting on sparse graphs

We consider the problem of counting 4-cycles (C_4) in a general undirect...
research
06/18/2019

On the Constrained Least-cost Tour Problem

We introduce the Constrained Least-cost Tour (CLT) problem: given an und...
research
03/07/2020

Classification of minimally unsatisfiable 2-CNFs

We consider minimally unsatisfiable 2-CNFs, i.e., minimally unsatisfiabl...
research
09/20/2019

Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach

Using the technique of amalgamation-detachment, we show that the complet...
research
02/16/2022

Locally EFX Allocations Over a Graph

The fairness notion of envy-free up to any good (EFX) has recently gaine...

Please sign up or login with your details

Forgot password? Click here to reset