scientific article
From MaRDI portal
Publication:3919752
zbMath0467.05056MaRDI QIDQ3919752
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stability numbermatching problemcovering problemsB-graphsedge critical graphsregularizable graphswell correct graphs
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items
Matching structure and bargaining outcomes in buyer-seller networks ⋮ Combinatorial properties of the family of maximum stable sets of a graph ⋮ Recursively decomposable well-covered graphs ⋮ On factors with given components ⋮ 1-extendability of independent sets ⋮ Critical and maximum independent sets of a graph ⋮ Matchings in graphs and groups ⋮ Strategic formation of homogeneous bargaining networks ⋮ Extending Berge's and Favaron's results about well-covered graphs ⋮ A classification of 1-well-covered graphs ⋮ A set and collection lemma ⋮ On \(\alpha\)-excellent graphs ⋮ On local maximum stable set greedoids ⋮ The average order of dominating sets of a graph ⋮ Combinatorial and spectral properties of König-Egerváry graphs ⋮ 1-extendability of independent sets ⋮ Arbitrarily regularizable graphs ⋮ Minimal 2-matching-covered graphs ⋮ Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets ⋮ A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets ⋮ Bipartite double cover and perfect 2-matching covered graph with its algorithm
