Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Affiliation:
2
0
0
Claw-free and line graph edge deletion on block graphs yield identical optimal solutions, surprisingly attained by the line graph of a forest.
A single vertex can be essential for maintaining connectivity, yet not guarantee an eternal connected vertex cover, revealing a subtle gap between static and dynamic graph defenses.