Triangulations and equality in the domination chain (Q494427): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2015.05.025
+Normal rank
@@ Property / OpenAlex ID @@
+W833184608
@@ Property / OpenAlex ID: W833184608 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139761
@@ Property / cites work: Q3139761 / rank @@
+Normal rank
@@ Property / cites work @@
+The sequence of upper and lower domination, independence and irredundance numbers of a graph
+Normal rank
@@ Property / cites work @@
+Q3797234
@@ Property / cites work: Q3797234 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of well covered graphs of girth 5 or greater
+Normal rank
@@ Property / cites work @@
+A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
+Normal rank
@@ Property / cites work @@
+On well-covered triangulations. I
@@ Property / cites work: On well-covered triangulations. I / rank @@
+Normal rank
@@ Property / cites work @@
+On well-covered triangulations. II.
@@ Property / cites work: On well-covered triangulations. II. / rank @@
+Normal rank
@@ Property / cites work @@
+On well-covered triangulations. III
@@ Property / cites work: On well-covered triangulations. III / rank @@
+Normal rank
@@ Property / cites work @@
+Q4243055
@@ Property / cites work: Q4243055 / rank @@
+Normal rank
@@ Property / cites work @@
+Some covering concepts in graphs
@@ Property / cites work: Some covering concepts in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+WELL-COVERED GRAPHS: A SURVEY
@@ Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for well‐covered graphs
@@ Property / cites work: Complexity results for well‐covered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Well irredundant graphs
@@ Property / cites work: Well irredundant graphs / rank @@
+Normal rank