Geodesic
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 1

Voir la notice de l'article provenant de la source Episciences

We give a sufficient condition for a degree sequence to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich. 
@article{DMTCS_2018_20_1_a23,
     author = {Cloteaux, Brian},
     title = {A {Sufficient} {Condition} for {Graphic} {Sequences} with {Given} {Largest} and {Smallest} {Entries,} {Length,} and {Sum}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {20},
     number = {1},
     year = {2018},
     doi = {10.23638/DMTCS-20-1-25},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-25/}
}
TY  - JOUR
AU  - Cloteaux, Brian
TI  - A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
JO  - Discrete mathematics & theoretical computer science
PY  - 2018
VL  - 20
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-25/
DO  - 10.23638/DMTCS-20-1-25
LA  - en
ID  - DMTCS_2018_20_1_a23
ER  - 
%0 Journal Article
%A Cloteaux, Brian
%T A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
%J Discrete mathematics & theoretical computer science
%D 2018
%V 20
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-25/
%R 10.23638/DMTCS-20-1-25
%G en
%F DMTCS_2018_20_1_a23
Cloteaux, Brian. A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum. Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 1. doi: 10.23638/DMTCS-20-1-25

Cité par Sources :