Connected permutation graphs (Q2455587): Difference between revisions

A permutation graph is a simple graph associated with a permutation. Let \(c_n\) be the number of connected permutation graphs on \(n\) vertices. Then the sequence \(\{c_n\}\) satisfies a recurrence relation such that it provides a partition of \(n!\).

0 references

reviewed by

Mirko Lepović

0 references

zbMATH Keywords

connected permutation graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2006.11.014

0 references

cites work

Q4146776

0 references

Q5545841

0 references

Enumerative aspects of certain subclasses of perfect graphs

0 references

Q3183088

0 references

Q4471290

0 references

Transitive Orientation of Graphs and Identification of Permutation Graphs

0 references

Q4344108

0 references

Identifiers

zbMATH Open document ID

1126.05058

0 references

DOI

10.1016/j.disc.2006.11.014

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2455587

@@ Property / cites work @@
+Q4146776
@@ Property / cites work: Q4146776 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545841
@@ Property / cites work: Q5545841 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerative aspects of certain subclasses of perfect graphs
+Normal rank
@@ Property / cites work @@
+Q3183088
@@ Property / cites work: Q3183088 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471290
@@ Property / cites work: Q4471290 / rank @@
+Normal rank
@@ Property / cites work @@
+Transitive Orientation of Graphs and Identification of                         Permutation Graphs
+Normal rank
@@ Property / cites work @@
+Q4344108
@@ Property / cites work: Q4344108 / rank @@
+Normal rank