Eternal vertex cover on bipartite graphs

DOI10.1007/978-3-031-09574-0_5OpenAlexW4285166191MaRDI QIDQ2097214

Saraswati Girish Nanoti, Jasine Babu, Neeldhara Misra

Publication date: 11 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09574-0_5

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Some algorithmic results for eternal vertex cover problem in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Parameterized algorithm for eternal vertex cover
• Automata, logics, and infinite games. A guide to current research
• Eternal connected vertex cover problem
• A substructure based lower bound for eternal vertex cover number
• Graphs with equal eternal vertex cover and eternal domination numbers
• On graphs with minimal eternal vertex cover number
• Parametrized complexity theory.
• Graph Theory
• Kernelization
• Kernelization Lower Bounds Through Colors and IDs
• Parameterized Algorithms
• A new lower bound for the eternal vertex cover number of graphs

This page was built for publication: Eternal vertex cover on bipartite graphs