Geodesic
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 2.

Voir la notice de l'article provenant de la source Episciences

A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic. In this work we present results on matching-decyclability in the following classes: Hamiltonian subcubic graphs, chordal graphs, and distance-hereditary graphs. In Hamiltonian subcubic graphs we show that deciding matching-decyclability is NP-complete even if there are exactly two vertices of degree two. For chordal and distance-hereditary graphs, we present characterizations of matching-decyclability that lead to $O(n)$-time recognition algorithms. 
@article{DMTCS_2018_20_2_a13,
     author = {Protti, F\'abio and Souza, U\'everton S.},
     title = {Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2018},
     doi = {10.23638/DMTCS-20-2-15},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-15/}
}
TY  - JOUR
AU  - Protti, Fábio
AU  - Souza, Uéverton S.
TI  - Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2018
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-15/
DO  - 10.23638/DMTCS-20-2-15
LA  - en
ID  - DMTCS_2018_20_2_a13
ER  - 
%0 Journal Article
%A Protti, Fábio
%A Souza, Uéverton S.
%T Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
%J Discrete mathematics & theoretical computer science
%D 2018
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-15/
%R 10.23638/DMTCS-20-2-15
%G en
%F DMTCS_2018_20_2_a13
Protti, Fábio; Souza, Uéverton S. Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs. Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 2. doi : 10.23638/DMTCS-20-2-15. http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-15/

Cité par Sources :