Transversals of longest cycles in partial k-trees and chordal graphs

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

1 Cita (Scopus)

Resumen

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

Idioma originalInglés
Páginas (desde-hasta)589-603
Número de páginas15
PublicaciónJournal of Graph Theory
Volumen98
N.º4
DOI
EstadoPublicada - dic. 2021

Huella

Profundice en los temas de investigación de 'Transversals of longest cycles in partial k-trees and chordal graphs'. En conjunto forman una huella única.

Citar esto