Transversals of Longest Cycles in Partial k-Trees and Chordal Graphs

12/27/2019
by   Juan Gutiérrez, et al.
0

Let lct(G) be the minimum cardinality of a set of vertices that intersects every longest cycle of a 2-connected graph G. We show that lct(G)≤ k-1 if G is a partial k-tree and that lct(G)≤max{1, ω(G)-3} if G is chordal, where ω(G) is the cardinality of a maximum clique in G. Those results imply that all longest cycles intersect in 2-connected series parallel graphs and in 3-trees.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/09/2021

All longest cycles intersect in partial 3-trees

We show that all longest cycles intersect in 2-connected partial 3-trees...
12/19/2017

Transversals of Longest Paths

Let (G) be the minimum cardinality of a set of vertices that intersects ...
10/07/2021

Isolation of connected graphs

For a connected n-vertex graph G and a set ℱ of graphs, let ι(G,ℱ) denot...
01/17/2012

The computation of first order moments on junction trees

We review some existing methods for the computation of first order momen...
01/02/2022

A Linear Algorithm for Computing Independence Polynomials of Trees

An independent set in a graph is a set of pairwise non-adjacent vertices...
12/18/2019

Extreme Values of the Fiedler Vector on Trees

Let G be a connected tree on n vertices and let L = D-A denote the Lapla...
06/30/2021

Combinatorial generation via permutation languages. IV. Elimination trees

An elimination tree for a connected graph G is a rooted tree on the vert...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.