Graphs with No Induced Five‐Vertex Path or Antipath (Q2978172): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.22022
@@ Property / DOI: 10.1002/jgt.22022 / rank @@
-Normal rank
@@ Property / cites work @@
+Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and the<i>H</i><sub>6</sub>-Conjecture
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Four classes of perfectly orderable graphs
@@ Property / cites work: Four classes of perfectly orderable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Split Graphs Having Dilworth Number Two
@@ Property / cites work: Split Graphs Having Dilworth Number Two / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
+Normal rank
@@ Property / cites work @@
+Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
+Normal rank
@@ Property / DOI @@
+.1002/JGT.22022
@@ Property / DOI: 10.1002/JGT.22022 / rank @@
+Normal rank