We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Solution to a Forcible Version of a Graphic Sequence Problem.
- Authors
Cai, Mao-cheng; Kang, Liying
- Abstract
Let A n = (a 1 , a 2 , … , a n) and B n = (b 1 , b 2 , … , b n) be nonnegative integer sequences with A n ≤ B n . The purpose of this note is to give a good characterization such that every integer sequence π = (d 1 , d 2 , … d n) with even sum and A n ≤ π ≤ B n is graphic. This solves a forcible version of problem posed by Niessen and generalizes the Erdős–Gallai theorem.
- Publication
Graphs & Combinatorics, 2022, Vol 38, Issue 3, p1
- ISSN
0911-0119
- Publication type
Article
- DOI
10.1007/s00373-022-02501-2