Graphical Degree Sequence Problems

Masaya TAKAHASHI; Keiko IMAI; Takao ASANO

Copy

Masaya TAKAHASHI, Keiko IMAI, Takao ASANO, "Graphical Degree Sequence Problems" in IEICE TRANSACTIONS on Fundamentals, vol. E77-A, no. 3, pp. 546-552, March 1994, doi: .
Abstract: A sequence of nonnegative integers S=(s₁, s₂, , s_n) is graphical if there is a graph with vertices v₁,v₂, ,v_n such that deg(v_i)=s_i 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_3_546/_p

Copy

@ARTICLE{e77-a_3_546,
author={Masaya TAKAHASHI, Keiko IMAI, Takao ASANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Graphical Degree Sequence Problems},
year={1994},
volume={E77-A},
number={3},
pages={546-552},
abstract={A sequence of nonnegative integers S=(s₁, s₂, , s_n) is graphical if there is a graph with vertices v₁,v₂, ,v_n such that deg(v_i)=s_i 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.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Graphical Degree Sequence Problems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 546
EP - 552
AU - Masaya TAKAHASHI
AU - Keiko IMAI
AU - Takao ASANO
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1994
AB - A sequence of nonnegative integers S=(s₁, s₂, , s_n) is graphical if there is a graph with vertices v₁,v₂, ,v_n such that deg(v_i)=s_i 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.
ER -