EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 69(83), pp. 34--40 (2001)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

ON DEGREE SEQUENCES OF GRAPHS WITH GIVEN CYCLOMATIC NUMBER

Manfred Schocker

Mathematisches Seminar der Universität, Ludewig-Meyn-Str. 4 24098 Kiel, Germany

Abstract: Starting with the Criterion by Gutman and Ruch for graphical partitions, Gutman analyzed degree sequences of connected graphs with cyclomatic number $c$, for $c\le 5$. In this paper, his results are revisited and, based on the Erdös-Gallai Criterion, extended to arbitrary values of $c$. Necessary and sufficient conditions are obtained for any partition to be the degree sequence of a connected graph with cyclomatic number $c$.

Classification (MSC2000): 05C75

Full text of the article:

Electronic fulltext finalized on: 5 Feb 2002. This page was last modified: 5 Feb 2002.

© 2002 Mathematical Institute of the Serbian Academy of Science and Arts
© 2002 ELibM for the EMIS Electronic Edition