Cycle transversals in bounded degree graphs
In this work we consider the problem of finding a minimum Ck-transversal (a subset of vertices hitting all the induced chordless cycles with k vertices) in a graph with bounded maximum degree. In particular, we seek for dichotomy results as follows: for a fixed value of k, finding a minimum Ck-trans...
Guardado en:
Autores principales: | Groshaus, M., Hell, P., Klein, S., Nogueira, L.T., Protti, F. |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_15710653_v35_nC_p189_Groshaus |
Aporte de: |
Ejemplares similares
-
Cycle transversals in bounded degree graphs
por: Groshaus, Marina E.
Publicado: (2009) -
EPT graphs on bounded degree trees
por: Alcón, Liliana Graciela, et al.
Publicado: (2014) -
Algorithms for finding clique-transversals of graphs
por: Durán, G., et al. -
Algorithms for finding clique-transversals of graphs
Publicado: (2008) -
Tight lower bounds on the number of bicliques in false-twin-free graphs
por: Groshaus, M., et al.