Some algorithmic results for eternal vertex cover problem in graphs

DOI10.7155/jgaa.v28i3.2972MaRDI QIDQ6636999

Kaustav K. Paul, Arti Pandey

Publication date: 12 November 2024

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

chain graphssplit graphseternal vertex cover\(P_4\)-sparse graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized algorithm for eternal vertex cover
• Modular decomposition and transitive orientation
• Eternal vertex cover on bipartite graphs
• On graphs whose eternal vertex cover number and vertex cover number coincide
• A substructure based lower bound for eternal vertex cover number
• On some domination colorings of graphs
• Recognizing $P_4 $-Sparse Graphs in Linear Time
• A new lower bound for the eternal vertex cover number of graphs
• Some algorithmic results for eternal vertex cover problem in graphs

This page was built for publication: Some algorithmic results for eternal vertex cover problem in graphs