Generalized subgraph-restricted matchings in graphs

DOI10.1016/j.disc.2004.08.027zbMath1063.05108OpenAlexW2002427023MaRDI QIDQ1779490

Sandra M. Hedetniemi, Wayne Goddard, Stephen T. Hedetniemi, Renu C. Laskar

Publication date: 1 June 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.027

zbMATH Keywords

graph propertyinduced matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (24)

Disconnected matchings ⋮ Acyclic Matching in Some Subclasses of Graphs ⋮ Acyclic matchings in graphs of bounded maximum degree ⋮ A lower bound on the acyclic matching number of subcubic graphs ⋮ On unicyclic graphs with uniquely restricted maximum matchings ⋮ On the hardness of deciding the equality of the induced and the uniquely restricted matching number ⋮ Induced matchings in subcubic graphs without short cycles ⋮ Uniquely restricted matchings in subcubic graphs ⋮ On the parameterized complexity of the acyclic matching problem ⋮ Acyclic matching in some subclasses of graphs ⋮ Minimum maximal acyclic matching in proper interval graphs ⋮ Weighted connected matchings ⋮ On the complexity of minimum maximal acyclic matchings ⋮ Revisiting semistrong edge‐coloring of graphs ⋮ Degenerate matchings and edge colorings ⋮ Lower bounds on the uniquely restricted matching number ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS ⋮ On complexity of special maximum matchings constructing ⋮ Approximating maximum acyclic matchings by greedy and local search strategies ⋮ On some hard and some tractable cases of the maximum acyclic matching problem ⋮ On the complexity of minimum maximal uniquely restricted matching ⋮ Disconnected matchings ⋮ On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph

Cites Work

• Irredundancy in circular arc graphs
• Induced matchings in bipartite graphs
• Matching theory
• NP-completeness of some generalizations of the maximum matching problem
• Induced matchings
• Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties
• New results on induced matchings
• Graph Classes: A Survey
• Ranks of zero patterns and sign patterns^*
• Decycling graphs
• Hereditary domination and independence parameters
• Paths, Trees, and Flowers
• Uniquely restricted matchings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized subgraph-restricted matchings in graphs