Decomposition of graphical sequences and unigraphs

25Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

A binary operation o is introduced on the set of graphs and is transferred to graphical sequences. The decomposition theorem stating that any graph and any graphical sequence can be uniquely decomposed into indecomposable components with respect to the operation o is proved. An exhaustive description of the structure of unigraphs based on this theorem is given. © 2000 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Tyshkevich, R. (2000). Decomposition of graphical sequences and unigraphs. Discrete Mathematics, 220(1–3), 201–238. https://doi.org/10.1016/S0012-365X(99)00381-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free