Eternal vertex cover on bipartite graphs
type: Item
instance of: scholarly article
title: Eternal vertex cover on bipartite graphs
DOI: 10.1007/978-3-031-09574-0_5
author: Jasine Babu
author: Neeldhara Misra
author: Saraswati Girish Nanoti
publication date: 2022-11-11T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7615731
MaRDI profile type: Publication
full work available at URL: 978-3-031-09574-0 5
OpenAlex ID: W4285166191
cites work: On graphs with minimal eternal vertex cover number
cites work: A new lower bound for the eternal vertex cover number of graphs
cites work: A substructure based lower bound for eternal vertex cover number
cites work: Parameterized Algorithms
cites work: Graph Theory
cites work: Kernelization Lower Bounds Through Colors and IDs
cites work: Fundamentals of parameterized complexity
cites work: Parametrized complexity theory.
cites work: Parameterized algorithm for eternal vertex cover
cites work: Kernelization
cites work: Eternal connected vertex cover problem
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Graphs with equal eternal vertex cover and eternal domination numbers
cites work: Q3059008
cites work: Q5710169
Recommended article: On graphs whose eternal vertex cover number and vertex cover number coincide
Recommended article: Vertex covers and eternal dominating sets
Recommended article: On graphs with minimal eternal vertex cover number
Recommended article: Q5298902
Recommended article: Some algorithmic results for eternal vertex cover problem in graphs
Recommended article: Graphs with equal eternal vertex cover and eternal domination numbers
Recommended article: A new lower bound for the eternal vertex cover number of graphs
Recommended article: Eternal connected vertex cover problem
Recommended article: Parameterized algorithm for eternal vertex cover
description: scientific article; zbMATH DE number 7615731