A classification of 1-well-covered graphs

DOI10.3906/MAT-2105-45zbMATH Open1494.05083OpenAlexW4256022885MaRDI QIDQ5097748FDOQ5097748

Authors: Zakir Deniz 

Publication date: 1 September 2022

Published in: Turkish Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3906/mat-2105-45

Recommendations

• On 1-well-covered graphs
• 1-well-covered graphs revisited
• A class of graphs with a few well-covered members
• scientific article; zbMATH DE number 5308096
• scientific article; zbMATH DE number 2068161
• scientific article; zbMATH DE number 434906
• A classification of all 1-Salem graphs
• Publication:3211344
• scientific article; zbMATH DE number 1286748

zbMATH Keywords

matchingwell-coveredindependent set

Mathematics Subject Classification ID

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

Cites Work

• A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
• On some subclasses of well-covered graphs
• A class of planar well‐covered graphs with girth four
• Some covering concepts in graphs
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• Well-covered claw-free graphs
• Title not available (Why is that?)
• Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
• Very well covered graphs
• On \(\alpha^{+}\)-stable König-Egerváry graphs
• Critical independent sets and König-Egerváry graphs
• Complexity results for well‐covered graphs
• Title not available (Why is that?)
• 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
• Node-weighted graphs having the König-Egerváry property
• Title not available (Why is that?)
• Efficient recognition of equimatchable graphs
• Title not available (Why is that?)
• A characterization of the 1-well-covered graphs with no 4-cycles
• Edge-stable equimatchable graphs
• 1-well-covered graphs revisited

Cited In (4)

• Title not available (Why is that?)
• Distinct sizes of maximal independent sets on graphs with restricted girth
• A classification of all 1-Salem graphs
• 1-well-covered graphs containing a clique of size \(n/3\)

This page was built for publication: A classification of 1-well-covered graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097748)