Critical independent sets of König-Egerváry graphs

DOI10.1016/j.dam.2022.04.014zbMath1493.05241OpenAlexW4281251691MaRDI QIDQ2146733

Hongliang Lu, Qinglin Yu, Zi-Xuan Yang

Publication date: 21 June 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.04.014

zbMATH Keywords

König-Egerváry graphcritical differencecritical independent set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On critical difference, independence number and matching number of graphs

Cites Work

• Critical sets in bipartite graphs
• The critical independence number and an independence decomposition
• On the intersection of all critical sets of a unicyclic graph
• Ear-decompositions of matching-covered graphs
• Matching theory
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• Critical and maximum independent sets of a graph
• Critical independent sets and König-Egerváry graphs
• Forbidden subgraphs and the König-Egerváry property
• On maximum matchings in König-Egerváry graphs
• 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

This page was built for publication: Critical independent sets of König-Egerváry graphs