1988
DOI: 10.1007/bf01070234
|View full text |Cite
|
Sign up to set email alerts
|

Graphs and degree sequences. I

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

1994
1994
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 101 publications
0
10
0
Order By: Relevance
“…In the case of bipartite sequences, a characterization known as the Gale-Ryser theorem [13,22,24] leads to efficient sequential algorithms for the decision as well as the search problems. Recently, degree sequence problems have gained lot of attention, see for example [2,3,4,9,21,23,25,26].…”
Section: Previous Resultsmentioning
confidence: 99%
“…In the case of bipartite sequences, a characterization known as the Gale-Ryser theorem [13,22,24] leads to efficient sequential algorithms for the decision as well as the search problems. Recently, degree sequence problems have gained lot of attention, see for example [2,3,4,9,21,23,25,26].…”
Section: Previous Resultsmentioning
confidence: 99%
“…al. established a relation between degree sequence of a graph and some structural properties of a graph [14], [15]. Equivalently, given an undirected graph, a degree sequence is a monotonic non-increasing sequence of the vertex degrees (valencies) of its graph vertices.…”
Section: Graph Operators and Degree Sequencementioning
confidence: 99%
“…The same year, Tyshkevich et al established a correspondence between DS of a graph and some structural properties of this graph [5]. In 1987, Tychkevich et al [6] written a survey on the same correspondence . In [7], the authors gave a new version of the Erdös-Gallai theorem on the realizability of a given DS.…”
Section: Narumi-katayama Index Of Double Graphsmentioning
confidence: 99%