On permutation labeling
oleh: M.A. Seoud, M.A. Salim
| Format: | Article |
|---|---|
| Diterbitkan: | SpringerOpen 2011-10-01 |
Deskripsi
We determine all permutation graphs of order ⩽9. We prove that every bipartite graph of order ⩽50 is a permutation graph. We convert the conjecture stating that “every tree is a permutation graph” to be “every bipartite graph is a permutation graph”.