On diameter of permutation graphs

Networks

Volumn 33, Issue 3, 1999, Pages 161-166

  Gu, Weizhen ^a  

^a TEXAS STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033130497     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199905)33:3<161::AID-NET1>3.0.CO;2-3     Document Type: Article

References (12)

1. [1] D. Bhattacharya, The minimum order of n-connected n-regular graphs with specified diameters, IEEE Trans Circuits Syst CAS-32, 407-409.
2. [2] M. Borowiecki, On the α-Permutation Graphs, Recent Advances in Graph Theory, Academia, Prague (1975), 89-92.
3. [3] G. Chartrand and J. Frechen, On the Chromatic Number of Permutation Graphs, Proof Techniques in Graph Theory, Academic Press, New York (1969), 21-24.
4. [4] G. Chartrand and F. Harary, Planar permutation graphs, Ann Inst H Poincare Sec B(N.S.) 3 (1967), 433-438.
5. [5] M. Ellingham, Peterson subdivisions in some regular graphs, Congr Numer 44 (1984), 33-40.
6. [6] S. Hedetniemi, On Classes of Graphs Defined by Special Cutsets of Lines, Lecture Notes in Mathematics 110, Springer, Berlin (1969), 171-190.
7. [7] V. Klee, Which Generalized Prisms Admit H-circuits? Lecture Notes in Mathematics 303, Springer, Berlin (1972), 173-178.
8. [8] B. Piazza and R. Ringeisen, Connectivity of generalized prisms over G Discr Appl Math 30 (1991), 229-233.
9. [9] B. Piazza and S. Stueckle, On the cut frequency vector of permutation graphs, Cong Numer 49 (1985), 143-145.
10. [10] R. Ringeisen, On cycle permutation graphs, Discr Math 51 (1984), 265-275.
11. [11] M. Watkins, A theorem on tait colorings with an application to the generalized Petersen graphs, J Combin Theory 6 (1969), 152-164.
12. [12] B. Zelinka, Edge-colorings of permutation graphs, Mat Casopis Sloven Akad Vied 23 (1973), 193-198.