Decycling with a matching

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Information Processing Letters

• Publication date

  2017-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ipl.2017.04.003
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Feedback vertex sets in cubic multigraphs

  2015cited by this paper
• Dominating and large induced trees in regular graphs

  2007cited by this paper
• The decycling number of graphs

  2002cited by this paper
• Decycling graphs

  1997cited by this paper
• Dominating subgraphs in graphs with some forbidden structures

  1994cited by this paper
• Maximum induced trees in graphs

  1986cited by this paper
• Distance-hereditary graphs

  1986cited by this paper
• The Planar Hamiltonian Circuit Problem is NP-Complete

  1976cited by this paper

• Near-bipartiteness on graphs having small dominating sets

  2025cites this paper
• Graph modification of bounded size to minor-closed classes as fast as vertex deletion

  2025cites this paper
• Near-Bipartiteness on graphs having small dominating sets: Structural characterization and algorithms

  2024cites this paper
• The Complexity of (P3, H)-Arrowing and Beyond

  2024cites this paper
• Eliminar Ciclos pela Remoção de um Emparelhamento Parametrizado pela Largura em Árvore é FPT

  2023cites this paper
• Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs

  2022cites this paper
• Bipartizando Grafos Livres de P6 pela Remoção de um Emparelhamento

  2022cites this paper
• Feedback Arc Number and Feedback Vertex Number of Cartesian Product of Directed Cycles

  2019cites this paper
• Bipartizing with a Matching

  2018cites this paper
• Eliminating Odd Cycles by Removing a Matching

  2017cites this paper
• On the computational complexity of the bipartizing matching problem

  2017cites this paper
• Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs

  2017influential citation
• Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes

  2017cites this paper