scientific article; zbMATH DE number 3732108
From MaRDI portal
Publication:3919752
Cited in
(26)- Minimal 2-matching-covered graphs
- Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
- A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
- Combinatorial properties of the family of maximum stable sets of a graph
- Recursively decomposable well-covered graphs
- Critical and maximum independent sets of a graph
- Matchings in graphs and groups
- Strategic formation of homogeneous bargaining networks
- 1-extendability of independent sets
- The average order of dominating sets of a graph
- Bipartite double cover and perfect 2-matching covered graph with its algorithm
- Matching structure and bargaining outcomes in buyer-seller networks
- On \(\alpha\)-excellent graphs
- Arbitrarily regularizable graphs
- Extending Berge's and Favaron's results about well-covered graphs
- A set and collection lemma
- A classification of 1-well-covered graphs
- Combinatorial and spectral properties of König-Egerváry graphs
- Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
- On factors with given components
- 1-extendability of independent sets
- On local maximum stable set greedoids
- 1-well-covered graphs containing a clique of size \(n/3\)
- Independent semitotal domination excellent graphs
- Characterization of -excellent 2-trees
- New structural bounds for \(\operatorname{ker}(G)\) and \(\operatorname{core}(G)\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919752)
