The following pages link to (Q3919752):
Displaying 23 items.
- Extending Berge's and Favaron's results about well-covered graphs (Q394212) (← links)
- A set and collection lemma (Q405128) (← links)
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- On factors with given components (Q594109) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- Minimal 2-matching-covered graphs (Q1043944) (← links)
- Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling (Q1297493) (← links)
- A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets (Q1322267) (← links)
- Combinatorial properties of the family of maximum stable sets of a graph (Q1348387) (← links)
- Recursively decomposable well-covered graphs (Q1356429) (← links)
- Critical and maximum independent sets of a graph (Q1671323) (← links)
- Matchings in graphs and groups (Q1671337) (← links)
- Strategic formation of homogeneous bargaining networks (Q1682708) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- The average order of dominating sets of a graph (Q2231709) (← links)
- Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652) (← links)
- Matching structure and bargaining outcomes in buyer-seller networks (Q2629522) (← links)
- On \(\alpha\)-excellent graphs (Q2683166) (← links)
- Arbitrarily regularizable graphs (Q3389691) (← links)
- A classification of 1-well-covered graphs (Q5097748) (← links)
- Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets (Q5862679) (← links)
- 1-extendability of independent sets (Q6119830) (← links)
- 1-well-covered graphs containing a clique of size \(n/3\) (Q6669819) (← links)
