论文信息 - Triangulations and equality in the domination chain

Triangulations and equality in the domination chain

In this paper we give a characterization of triangulations where all minimal dominating sets have the same cardinality and a characterization of triangulations where all six domination parameters are the same.

Stephen Finbow | Christopher M. van Bommel

[1] Ramesh S. Sankaranarayana,et al. Complexity results for well-covered graphs , 1992, Networks.

[2] Michael D. Plummer,et al. Well-covered triangulations: Part IV , 2016, Discret. Appl. Math..

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

[4] V. Chvátal,et al. A Note on Well-Covered Graphs , 1993 .

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

[6] Michael D. Plummer,et al. On well-covered triangulations: Part II , 2009, Discret. Appl. Math..

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

[8] Jerzy Topp,et al. Well Irredundant Graphs , 1995, Discret. Appl. Math..

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

[10] M. Plummer. WELL-COVERED GRAPHS: A SURVEY , 1993 .