Generalized subgraph-restricted matchings in graphs

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

Wayne Goddard, Sandra M. Hedetniemi, 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 property; induced matchings

Mathematics Subject Classification ID

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

Related Items

ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS, Induced matchings in subcubic graphs without short cycles, On complexity of special maximum matchings constructing, Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids, On unicyclic graphs with uniquely restricted maximum matchings, On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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^*
• Hereditary domination and independence parameters
• Paths, Trees, and Flowers
• Uniquely restricted matchings