Using maximality and minimality conditions to construct inequality chains

[1]  O. Ore.  Theory of Graphs , 1962 .

[2]  Claude Berge.  Theory of graphs and its applications , 1962 .

[3]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[4]  Frank Harary,et al.  Graph Theory , 2016 .

[5]  M. Plummer.  Some covering concepts in graphs , 1970 .

[6]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[7]  J. Nieminen.  Two Bounds for the Domination Number of a Graph , 1974 .

[8]  Yousef Alavi,et al.  Total matchings and total coverings of graphs , 1977, J. Graph Theory.

[9]  P. Slater.  Enclaveless Sets and MK-Systems. , 1977, Journal of research of the National Bureau of Standards.

[10]  Stephen T. Hedetniemi,et al.  Towards a theory of domination in graphs , 1977, Networks.

[11]  Robert B. Allan,et al.  On domination and independent domination numbers of a graph , 1978, Discret. Math..

[12]  E. Cockayne,et al.  Properties of Hereditary Hypergraphs and Middle Graphs , 1978, Canadian Mathematical Bulletin.

[13]  Jo Ann W. Staples,et al.  On some subclasses of well-covered graphs , 1979, J. Graph Theory.

[14]  R. Nowakowski,et al.  Strong independence in graphs , 1980 .

[15]  Eugene L. Lawler,et al.  Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.

[16]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

[17]  Stephen T. Hedetniemi,et al.  Gallai theorems for graphs, hypergraphs, and set systems , 1988, Discret. Math..

[18]  E. Cockayne,et al.  GENERALISED MAXIMAL INDEPENDENCE PARAMETERS FOR PATHS AND CYCLES , 1990 .

[19]  Michael S. Jacobson,et al.  A Note on Graphs Which Have Upper Irredundance Equal to Independence , 1993, Discret. Appl. Math..

[20]  Joseph Douglas Horton,et al.  Minimum Edge Dominating Sets , 1993, SIAM J. Discret. Math..

[21]  Ernest J. Cockayne,et al.  The sequence of upper and lower domination, independence and irredundance numbers of a graph , 1993, Discret. Math..

[22]  Richard J. Nowakowski,et al.  A Characterization of Well Covered Graphs of Girth 5 or Greater , 1993, J. Comb. Theory, Ser. B.

[23]  F. Harary,et al.  Independent domination in hypercubes , 1993 .

[24]  Richard J. Nowakowski,et al.  A characterization of well-covered graphs that contain neither 4- nor 5-cycles , 1994, J. Graph Theory.

[25]  Michael R. Fellows,et al.  The Private Neighbor Cube , 1994, SIAM J. Discret. Math..

[26]  Gerd Fricke,et al.  Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance , 1994, Discret. Appl. Math..

[27]  Michael A. Henning,et al.  The ratio of the distance irredundance and domination numbers of a graph , 1994 .

[28]  Alice A. McRae.  Generalizing NP-completeness proofs for bipartite graphs and chordal graphs , 1995 .

[29]  Mehdi Behzad,et al.  Graphs and Digraphs , 1981, The Mathematical Gazette.