On relating edges in graphs without cycles of length 4 (Q2447533): Difference between revisions

@@ 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.jda.2013.09.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2147078876
@@ Property / OpenAlex ID: W2147078876 / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of well-covered graphs with no cycles of length 4
+Normal rank
@@ Property / cites work @@
+Recognizing Greedy Structures
@@ Property / cites work: Recognizing Greedy Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Local Structure When All Maximal Independent Sets Have Equal Weight
+Normal rank
@@ Property / cites work @@
+Q3139761
@@ Property / cites work: Q3139761 / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Well covered simplicial, chordal, and circular arc graphs
+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