Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

A realizable degree sequence can be realized in many ways as a graph. There are several tests for determining realizability of a degree sequence. Up to now, not much was known about the common ...

Edge-homotopy and vertex-homotopy are equivalence relations on spatial graphs which are generalizations of Milnor's link-homotopy. We introduce some edge (resp. vertex)-homotopy invariants of spatial ...