Some criteria for integer sequences pair being realizable by a graph

Publication date 13 September 2022

Abstract: Let

A = (a_{1}, l d o t s, a_{n})

and

B = (b_{1}, l d o t s, b_{n})

be two sequences of nonnegative integers with

a_{i} l e b_{i}

for

1 l e i l e n

. The pair

(A; B)

is said to be realizable by a graph if there exists a simple graph

G

with vertices

v_{1}, l d o t s, v_{n}

such that

a_{i} l e d_{G} (v_{i}) l e b_{i}

for

1 l e i l e n

. Let

p r e c e q

denote the lexicographic ordering on

Z i m e s Z :

. We say that the sequences

A

and

B

are in good order if

(a_{i + 1}, b_{i + 1}) p r e c e q (a_{i}, b_{i})

. In this paper, we consider the generalizations of six classical characterizations on sequences pair due to Berge, Ryser et al. and present related results.

This page was built for publication: Some criteria for integer sequences pair being realizable by a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6410680)