All longest cycles intersect in partial 3-trees

03/09/2021
by   Juan Gutiérrez, et al.
0

We show that all longest cycles intersect in 2-connected partial 3-trees.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/27/2019

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

Let lct(G) be the minimum cardinality of a set of vertices that intersec...
06/13/2021

A Phylogenetic Trees Analysis of SARS-CoV-2

One regards spaces of trees as stratified spaces, to study distributions...
07/24/2014

Learning Structured Outputs from Partial Labels using Forest Ensemble

Learning structured outputs with general structures is computationally c...
08/01/2018

Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns

Tverberg's theorem says that a set with sufficiently many points in R^d ...
04/08/2020

Comparison of the shape and temporal evolution of even and odd solar cycles

Results. The PCA confirms the existence of the Gnevyshev gap (GG) for so...
11/29/2017

Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs

In this paper, we build on recent results by Chauve et al. (2014) and Ba...
04/29/2018

Trees in partial Higher Dimensional Automata

In this paper, we give a new definition of partial Higher Dimension Auto...
This week in AI

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