The following pages link to Some covering concepts in graphs (Q5591382):
Displaying 50 items.
- A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals (Q256536) (← links)
- Well-covered triangulations. IV (Q323041) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- When is \(G^2\) a König-Egerváry graph? (Q367094) (← links)
- On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 (Q389981) (← links)
- Extending Berge's and Favaron's results about well-covered graphs (Q394212) (← links)
- On CIS circulants (Q394314) (← links)
- Independent protection in graphs (Q400447) (← links)
- Independence polynomials of some compound graphs (Q412382) (← links)
- Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
- The well-covered dimension of products of graphs (Q472139) (← links)
- Vertex-transitive CIS graphs (Q472401) (← links)
- Triangulations and equality in the domination chain (Q494427) (← links)
- Cohen-Macaulayness of saturation of the second power of edge ideals (Q505849) (← links)
- Crowns in bipartite graphs (Q510531) (← links)
- On well-covered pentagonalizations of the plane (Q526819) (← links)
- On the location of roots of independence polynomials (Q596652) (← links)
- Well-covered circulant graphs (Q626761) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- Complexity results for generating subgraphs (Q724239) (← links)
- Building graphs whose independence polynomials have only real roots (Q844224) (← links)
- The well-covered dimension of random graphs (Q864120) (← links)
- On the order of uniquely (k,m)-colourable graphs (Q923092) (← links)
- On well-covered triangulations. II. (Q967322) (← links)
- On well-covered triangulations. III (Q972324) (← links)
- On the well-coveredness of Cartesian products of graphs (Q998514) (← links)
- The uniformity space of hypergraphs and its applications (Q1301700) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets (Q1322267) (← links)
- Strongly well-covered graphs (Q1336664) (← links)
- The structure of well-covered graphs and the complexity of their recognition problems (Q1354731) (← links)
- Recursively decomposable well-covered graphs (Q1356429) (← links)
- Totally equimatchable graphs (Q1356717) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- On well-covered triangulations. I (Q1414586) (← links)
- Well-located graphs: A collection of well-covered ones (Q1422424) (← links)
- Roots of independence polynomials of well covered graphs (Q1577528) (← links)
- \(W_2\)-graphs and shedding vertices (Q1690016) (← links)
- The roller-coaster conjecture revisited (Q1696536) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On well-covered Cartesian products (Q1756093) (← links)
- Graphs with the Erdős-Ko-Rado property (Q1779495) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Graph operations preserving \(W_{2}\)-property (Q1792056) (← links)
- Very well covered graphs (Q1837211) (← links)
- Well irredundant graphs (Q1917235) (← links)
- The cyclomatic number of a graph and its independence polynomial at \(- 1\) (Q1950412) (← links)
- On the Cartesian product of non well-covered graphs (Q1953503) (← links)
- Domination related parameters in the generalized lexicographic product of graphs (Q2030248) (← links)
