On permutation labeling
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”.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2011-10-01
|
| Series: | Journal of the Egyptian Mathematical Society |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1110256X11000228 |