Tutte sets in graphs II: The complexity of finding maximum Tutte sets (original) (raw)
Related papers
Tutte sets in graphs I: Maximal tutte sets and D-graphs
Journal of Graph Theory, 2007
Open journal of Discrete Mathematics, 2016
On upper bounds for parameters related to the construction of special maximum matchings
Discrete Mathematics, 2012
On the Maximum Uniquely Restricted Matching for Bipartite Graphs
Electronic Notes in Discrete Mathematics, 2011
On the computational complexity of the bipartizing matching problem
Annals of Operations Research, 2021
Matchability and -maximal matchings
Discrete Applied Mathematics, 2011
An Extremal Property of Turán Graphs, II
Journal of Graph Theory, 2013
An O(n) Time Algorithm For Maximum Induced Matching In Bipartite Star_123-free Graphs
2014
Computational complexity of maximum distance-(k, l) matchings in graphs
An upper bound for a parameter related to special maximum matching constructing
2009
Another extremal problem for Turan graphs
Discrete Mathematics, 1987
Maximal Induced Matchings in Triangle-Free Graphs
Lecture Notes in Computer Science, 2014
Some exact results for generalized Turán problems
European Journal of Combinatorics, 2022
Algorithmica, 2003
An Extremal Property of Turán Graphs
Electronic Journal of Combinatorics, 2010
Smallest maximal matchings of graphs
Hacettepe Journal of Mathematics and Statistics
Tight bounds on maximal and maximum matchings
Discrete …, 2004
Induced Matching in Some Subclasses of Bipartite Graphs
Algorithms and Discrete Applied Mathematics, 2017
Complexity of Paired Domination in AT-free and Planar Graphs
Algorithms and Discrete Applied Mathematics, 2022
TRIANGLE-FREE 2-MATCHINGS REVISITED
Discrete Mathematics, Algorithms and Applications, 2010
Matchability and k-maximal matchings
2011
Maximum semi-matching problem in bipartite graphs
Discussiones Mathematicae Graph Theory, 2013
The complexity of the matching-cut problem for planar graphs and other graph classes
Journal of Graph Theory, 2009
The Parallel and Sequential Complexity of Matching on Chordal and Strongly Chordal Graphs
1995
Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs
2014
GRAPHS WITH MAXIMAL INDUCED MATCHINGS OF THE SAME SIZE
Journal of Combinatorial Optimization, 2015
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics, 2009
Acyclic Matching in Some Subclasses of Graphs
Lecture Notes in Computer Science
On upper bounds for parameters related to construction of special maximum matchings
2008
On the computational complexity of matching on chordal and strongly chordal graphs
1994