Decycling with a matching

Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme L. Szwarcfiter

Type: Article

Publication Date: 2017-04-21

Citations: 10

DOI: https://doi.org/10.1016/j.ipl.2017.04.003

Similar Works

Action	Title	Year	Authors
+	Matching configurations	1992	Alexander J. Collins
+	Matching and Covering	2023	Santosh Kumar Yadav
+	Clifford Takes a Trip	1966	Norman Bridwell
+ PDF Chat	Pattern Matching in Doubling Spaces	2021	Corentin Allair Antoine Vigneron
+	Pascal's Hexagram with Certain Elements in Motion	1933	W. H. Bunch
+	Pascal's Hexagram with Certain Elements in Motion	1933	W. H. Bunch
+	On a matching problem	1952	Chikio Hayashi Hirotugu Akaike
+	Geodesic Matching with Free Extremities	2006	Laurent Garcin Laurent Younès
+	Blanket-tossing	1873	John Pickford
+	Matching straight lines	1988	James H McIntosh Kathleen M Mutch
+	Maximum Matching	2015	Marcin Mucha
+	Maximum Matching	2016	Marcin Mucha
+	Concatenating random matchings	2024	Fabian Burghart Paul Thévenin
+	Blending circles	2020	Vincent C. H. Chua Gillian Koh Tan Ern Ser Drew Shih
+	A new strategy for tripling	2021	Hongyi Li Hong Qin
+	Messing about with Euclid	2011	Yang Yan Houman Harouni Mackenzie Hird Brian J. McCarthy Amanda Pillsbury Zengxu Yang
+	Balancing Emery Wheels	1877
+	Disentangling a Triangle	2009	Jerzy Kocik Andrzej Solecki
+	string of casing	2014
+	Jack on a Devil’s Staircase	2018	Andrea Di Gioacchino Marco Gherardi Luca Guido Molinari Pietro Rotondo

Action	Title	Year	Authors
+ PDF Chat	Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs	2022	Diane Castonguay Erika M. M. Coelho Hebert Coelho Julliano R. Nascimento Uéverton S. Souza
+	On the Computational Complexity of the Bipartizing Matching Problem	2017	Carlos V. G. C. Lima Dieter Rautenbach Uéverton S. Souza Jayme L. Szwarcfiter
+	Feedback Arc Number and Feedback Vertex Number of Cartesian Product of Directed Cycles	2019	Xiaohong Chen Baoyindureng Wu
+ PDF Chat	On the computational complexity of the bipartizing matching problem	2021	Carlos V. G. C. Lima Dieter Rautenbach Uéverton S. Souza Jayme L. Szwarcfiter
+	Bipartizing with a Matching	2018	Carlos V. G. C. Lima Dieter Rautenbach Uéverton S. Souza Jayme L. Szwarcfiter
+	Eliminating Odd Cycles by Removing a Matching.	2017	Carlos V. G. C. Lima Dieter Rautenbach Uéverton S. Souza Jayme L. Szwarcfiter
+	Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes	2017	Fábio Protti Uéverton S. Souza
+	Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs	2017	Fábio Protti Uéverton S. Souza

Action	Title	Year	Authors
+	The decycling number of graphs	2002	Sheng Bau Lowell W. Beineke Fort Wayne
+	Dominating subgraphs in graphs with some forbidden structures	1994	Jiping Liu Huishan Zhou
+	Maximum induced trees in graphs	1986	Paul Erdős Michael Saks Vera T. Sós