Problems on matchings and independent sets of a graph

DOI10.1016/j.disc.2018.02.021zbMath1384.05130arXiv1701.03040OpenAlexW2793542804MaRDI QIDQ1744740

Anupam Mondal, Amitava Bhattacharya, T. Srinivasa Murthy

Publication date: 19 April 2018

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

Full work available at URL: https://arxiv.org/abs/1701.03040

zbMATH Keywords

matchingindependent setcritical setunicyclic graphKönig-Egerváry graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

On the critical difference of almost bipartite graphs ⋮ On critical difference, independence number and matching number of graphs ⋮ On König-Egerváry collections of maximum critical independent sets ⋮ On an annihilation number conjecture

Cites Work

• Critical sets in bipartite graphs
• A characterization of the graphs in which the transversal number equals the matching number
• On the intersection of all critical sets of a unicyclic graph
• Matching theory
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• Combinatorial properties of the family of maximum stable sets of a graph
• Critical and maximum independent sets of a graph
• Critical independent sets and König-Egerváry graphs
• On the structure of the minimum critical independent set of a graph
• On some conjectures concerning critical independent sets of a graph
• Vertices Belonging to All Critical Sets of a Graph
• Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Problems on matchings and independent sets of a graph