Extending Berge's and Favaron's results about well-covered graphs (Q394212): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6250382
@@ Property / zbMATH DE Number: 6250382 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+well-covered graph
@@ Property / zbMATH Keywords: well-covered graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximal independent set
@@ Property / zbMATH Keywords: maximal independent set / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2013.08.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2009136291
@@ Property / OpenAlex ID: W2009136291 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3919752
@@ Property / cites work: Q3919752 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Structure When All Maximal Independent Sets Have Equal Weight
+Normal rank
@@ Property / cites work @@
+Recognizing Greedy Structures
@@ Property / cites work: Recognizing Greedy Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139761
@@ Property / cites work: Q3139761 / rank @@
+Normal rank
@@ Property / cites work @@
+Very well covered graphs
@@ Property / cites work: Very well covered graphs / 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 @@
+Q4243055
@@ Property / cites work: Q4243055 / rank @@
+Normal rank
@@ Property / cites work @@
+On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
+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 @@
+Well covered simplicial, chordal, and circular arc graphs
+Normal rank
@@ Property / cites work @@
+On well-covered graphs of odd girth 7 or greater
@@ Property / cites work: On well-covered graphs of odd girth 7 or greater / rank @@
+Normal rank
@@ Property / cites work @@
+Q4179024
@@ Property / cites work: Q4179024 / 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-covered claw-free graphs
@@ Property / cites work: Well-covered claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of well-covered graphs and the complexity of their recognition problems
+Normal rank
@@ Property / cites work @@
+Q3351385
@@ Property / cites work: Q3351385 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:394212