Graphs and degree sequences: Canonical decomposition

DOI10.1007/BF01069217MaRDI QIDQ3666887zbMATH OpenFDO

Authors O. I. Mel'nikov, V. M. Kotov, Regina Iosifovna Tyshkevich

Publication date 1981

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01069217

zbMATH Keywords

canonical decompositiongraphic degree sequencespolar graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph theory (05C99)

Cites work

• Line removal algorithms for graphs and their degree lists
• Matrices of zeros and ones
• On factorable degree sequences

Cited in

(10)

• Contributions to the theory of graphic sequences
• On forcibly hereditary P-graphical sequences
• Relaxed and approximate graph realizations
• On vertex-weighted realizations of acyclic and general graphs
• Degree sequence of graph operator for some standard graphs
• Graphs and degree sequences. I
• Algebraic structure of graph operations in terms of degree sequences
• Graph realizations: maximum degree in vertex neighborhoods
• Degree sequences of matrogenic graphs
• Once more on matrogenic graphs

This page was built for publication: Graphs and degree sequences: Canonical decomposition

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