Graphical Degree Sequence Problems

Masaya TAKAHASHI  Keiko IMAI  Takao ASANO  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E77-A   No.3   pp.546-552
Publication Date: 1994/03/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Graphs, Networks and Matroids
Keyword: 
algorithm,  degree sequence,  graph,  efficiency,  matching,  

Full Text: PDF>>
Buy this Article




Summary: 
A sequence of nonnegative integers S=(s1, s2, , sn) is graphical if there is a graph with vertices v1,v2, ,vn such that deg(vi)=si for each i=1, 2, , n. The graphical degree sequence problem is: Given a sequence of nonnegative integers, determine whether it is graphical or not. In this paper, we consider several variations of the graphical degree sequence problem and give efficient algorithms.