Graphs and degree sequences. I
From MaRDI portal
Publication:3803156
DOI10.1007/BF01070234zbMath0656.05053OpenAlexW4211027782MaRDI QIDQ3803156
A. A. Chernyak, Regina I. Tyshkevich, Zhanna A. Chernyak
Publication date: 1987
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01070234
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items (11)
On degree sequences of undirected, directed, and bidirected graphs ⋮ Vertex-weighted graphs: realizable and unrealizable domains ⋮ Independence number of graphs and line graphs of trees by means of omega invariant ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Degree sequence of graph operator for some standard graphs ⋮ Extremal problems on components and loops in graphs ⋮ Tripartite graphs with given degree set ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Relaxed and approximate graph realizations
Cites Work
- Conditions for sequences to be r-graphic
- A theorem on flows in networks
- A generalization of the Bondy-Chvátal theorem on the k-closure
- Degree sequences of matrogenic graphs
- Once more on matrogenic graphs
- Two theorems on Hamiltonian graphs
- Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
- The network flows approach for matrices with given row and column sums
- Properties of (0,1)-matrices with no triangles
- Distance degree regular graphs
- Potentially 2-connected integer pair sequences
- The forcibly-tree and forcibly-unicyclic degree sequences
- Matrices of zeros and ones with fixed row and column sum vectors
- Graphs with prescribed degree sets and girth
- Characterization of forcibly k-variegated degree sequences, \(k\geq 3\)
- An unresolved conjecture on nonmaximal planar graphical sequences
- Characterization of unigraphic and unidigraphic integer-pair sequences
- Properties of unique realizations - a survey
- Characterisation of potentially bipartite self-complementary bipartitioned sequences
- Degree sets of k-trees: Small k
- The splittance of a graph
- On the existence and connectivity of a class of maximal planar graphs
- Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
- Pairs of sequences with a unique realization by bipartite graphs
- Sequences with a unique realization by simple graphs
- Simple separable graphs
- Graphic sequences with unique realization
- Relations between graphs and integer-pair sequences
- A method in graph theory
- On graphical partitions and planarity
- Characterization of self-complementary graphs with 2-factors
- Construction of Hamiltonian graphs and bigraphs with prescribed degrees
- On graphs with equal edge-connectivity and minimum degree
- Pancyclic graphs and a conjecture of Bondy and Chvatal
- The k-factor conjecture is true
- On forcibly hereditary P-graphical sequences
- Extremal f-trees and embedding spaces for molecular graphs
- Integer-pair sequences with self-complementary realizations
- On Hamilton's ideals
- On factorable degree sequences
- Algorithms for constructing graphs and digraphs with given valences and factors
- Class of graphs with restricted neighborhoods
- Combinatorial Properties of Matrices of Zeros and Ones
- Box-threshold graphs
- Note on vertex degrees of planar graphs
- Degree sets and graph factorizations
- Graphs and degree sequences: Canonical decomposition
- A property of adjacency matrices of realizations of pair sequences
- On some regularities of graphs. II.
- Rao's conjecture on self-complementary graphs withK-factors
- A Note on Degree Sequences of Graphs
- Graphical Completions of a Sequence
- The orders of graphs with prescribed degree sets
- On a conjecture on maximal planar sequences
- Making Connections: A Graphical Construction
- Counterexamples to randić's conjecture on distance degree sequences for trees
- Minimum-Loop Realization of Degree Sequences
- Cages—a survey
- Degree sets for homogeneously traceable non-Hamiltonian graphs
- The structure of threshold graphs
- Switchings Constrained to 2-Connectivity in Simple Graphs
- Threshold Sequences
- Bipartite graphs with cycles of all even lengths
- A Note on Unigraphic Sequences
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- Degree sets for graphs
- Some recent results in hamiltonian graphs
- Line removal algorithms for graphs and their degree lists
- On Planar Graphical Degree Sequences
- Unicyclic realizability of a degree list
- Linear Separation of Dominating Sets in Graphs
- A Generalization of Line Connectivity and Optimally Invulnerable Graphs
- Line-graphical degree sequences
- On the connectivity of maximal planar graphs
- A Note onn-Edge-Connectivity
- On the Connectivity of Maximal Planar Graphs with Minimum Degree 5
- Some Properties of Graphs with Multiple Edges
- A Graph-Theoretic Approach to a Communications Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphs and degree sequences. I
