When is \(G^2\) a König-Egerváry graph?

DOI10.1007/s00373-012-1196-5zbMath1272.05152OpenAlexW2078116550MaRDI QIDQ367094

Eugen Mandrescu, Vadim E. Levit

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1196-5

zbMATH Keywords

perfect matchingmaximum independent setsquare of a graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of the graphs in which the transversal number equals the matching number
• The critical independence number and an independence decomposition
• Matching theory
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
• König-Egerváry graphs, 2-bicritical graphs and fractional matchings
• Very well covered graphs
• On \(\alpha^{+}\)-stable König-Egerváry graphs
• Critical independent sets and König-Egerváry graphs
• Node-weighted graphs having the König-Egerváry property
• Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
• Some covering concepts in graphs