Loading...
Loading...

Go to the content (press return)

On (circuit-) destroyable graphs

Author
Grau, J.; López, S.C.
Type of activity
Presentation of work at congresses
Name of edition
6th Gdansk Workshop on Graph Theory
Date of publication
2018
Presentation's date
2018-07-02
Book of congress proceedings
The 6th Gdanks workshop on graph theory
First page
43
Last page
43
Abstract
A vertex cover of a simple graph G is a subset of vertices S ¿ V (G) which covers all edges, that is, for every pair of adjacent vertices u and v, either u or v belong to S. The minimum size of a vertex cover of G is denoted by ß(G). Let G be a connected simple graph. We say that G is destroyable or trail-coverable if there is a trail P that is vertex cover, if that is the case, we say that P is a covering trail. In particular, when the covering trail may be a path, we say path-destroyable. We...
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

  • Grau, José María  (author and speaker )
  • López Masip, Susana Clara  (author and speaker )