Graphs and degree sequences. II
DOI10.1007/BF01082602zbMATH Open0712.05055MaRDI QIDQ3496366FDOQ3496366
Regina Iosifovna Tyshkevich, A. A. Chernyak, Zhanna A. Chernyak
Publication date: 1988
Published in: Cybernetics (Search for Journal in Brave)
Recommendations
graph decompositiondecomposition methodsplit graphsthreshold graphshereditary propertiesfactorsgraphic sequencesp-graphic sequence
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cited In (10)
- Relaxed and approximate graph realizations
- Maximal graphs and graphs with maximal spectral radius
- Graph realizations: maximum degree in vertex neighborhoods
- How likely is an LLD degree sequence to be graphical?
- Vertex-weighted graphs: realizable and unrealizable domains
- On second order degree of graphs
- On vertex-weighted realizations of acyclic and general graphs
- Tripartite graphs with given degree set
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs
- Archimedean graph designs. II.
This page was built for publication: Graphs and degree sequences. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496366)