A new lower bound for the eternal vertex cover number of graphs | SpringerLink
Graph coloring - Wikipedia
A substructure based lower bound for eternal vertex cover number - ScienceDirect
An Exact Algorithm for Minimum Vertex Cover Problem
Vertex Cover Problem (Dynamic Programming Solution for Tree) - GeeksforGeeks
CS787: Advanced Algorithms Lecture 9: Approximation Algorithms In this lecture we will discuss some NP-complete optimization pro
A substructure based lower bound for eternal vertex cover number - ScienceDirect
Mathematics | Free Full-Text | Domination Coloring of Graphs
complexity theory - How does one prove an upper/lower bound of a parallel algorithm? - Stack Overflow
Simple Bounds on Vertex Connectivity | Graph Theory - YouTube
Graph hierarchy: a novel framework to analyse hierarchical structures in complex networks | Scientific Reports
approximation - How are matchings a lower bound for an approximate vertex cover? - Computer Science Stack Exchange
Lower Bounds
Introduction and Approximate Solution for Vertex Cover Problem - GeeksforGeeks
Lower Bounds Based on ETH
PDF) An Exact Algorithm for Minimum Vertex Cover Problem
Vertex cover - Wikipedia
Vertex Cover Problem - InterviewBit
ICS 46 Spring 2022, Notes and Examples: Graph Connectedness
Travelling Salesman Problem using Branch and Bound | Techie Delight
L15_ApproxAlgs
PDF) Optimization of Unweighted Minimum Vertex Cover
graphs - Error lower-bound for an algorithm for vertex cover - Computer Science Stack Exchange
Graph Theory - Part I | HackerEarth
