On homotopy of connected graphs having the same degree function

Discrete Mathematics

Volumn 230, Issue 1-3, 2001, Pages 167-187

  Kelmans, Alexander ^a,b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF PUERTO RICO   (Puerto Rico)

Author keywords

Connectivity; Degree function; Simple graphs; Switch operations

Indexed keywords

EID: 0038749015     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00079-0     Document Type: Article

References (13)

1. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, North-Holland, Amsterdam, 1976.
2. V. Chvátal, P.L. Hammer, Aggregation of inequalities in integer programming, Ann. Discrete Math. 1 (1977) 145-162.
3. S.L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph, SIAM J. Appl. Math. 10 (1962) 496-506, II (1963) 135-147.
4. S.L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph, SIAM J. Appl. Math. 10 (1962) 496-506, II (1963) 135-147.
5. V. Havel, A remark on the existence of finite graphs, Casopis Pest. Mat. 80 (1955) 477-480.
6. I.N. Herstein, Topics in Algebra, Wiley, New York, 1975.
7. A.K. Kelmans, A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs, Discrete Math. 64 (1987) 13-25.
8. A.K. Kelmans, On degree functions of graphs, XI SIDIM, UPR, April 1996.
9. A.K. Kelmans, Graph transformations preserving degree function and connectivity, RUTCOR Research Report 39-98, Rutgers University, 1998.
10. A.K. Kelmans, Vertex distances in graphs of a given degree function, in print.
11. N.V.R. Mahadev, U.N. Peled, Threshold graphs and related topics, Annals of Discrete Mathematics, Vol. 56, North-Holland. Amsterdam, 1995.
12. N. Robertson, P. Seymour, R. Thomas, Kuratowski chains, J. Combin. Theory B 64 (1995) 127-154.
13. H. Whitney, 2-isomorphic graphs, Amer. Math. J. 55 (1933) 73-84.