1 problem
Matching
Let be a very well covered graph, and for let denote its -th jet graph. A graph is very well covered if all its minimal vertex covers hav…
Let be a very well covered graph, and for let denote its -th jet graph. A graph is very well covered if all its minimal vertex covers hav…