Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number

DOI10.1016/j.dam.2021.07.034zbMath1473.05100OpenAlexW3188946402MaRDI QIDQ2231756

Sergio Bermudo, Magda Dettlaff, Magdalena Lemańska

Publication date: 30 September 2021

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

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

zbMATH Keywords

matchingperfect graphsvertex coverweakly connected domination

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) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial and spectral properties of König-Egerváry graphs
• König-Egerváry graphs are non-Edmonds
• Topics on perfect graphs
• Clustering wireless ad hoc networks with weakly connected dominating set
• Bounds relating the weakly connected domination number to the total domination number and the matching number
• Ear-decompositions of matching-covered graphs
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• On weakly connected domination in graphs
• König-Egerváry graphs, 2-bicritical graphs and fractional matchings
• On some graph classes related to perfect graphs: a survey
• Forbidden subgraphs and the König-Egerváry property
• Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
• Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
• [https://portal.mardi4nfdi.de/wiki/Publication:4948507 A short proof of K�nig's matching theorem]

This page was built for publication: Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number