Relations between graphs and integer-pair sequences
From MaRDI portal
Cites work
- A Graph-Theoretic Approach to a Class of Integer-Programming Problems
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the degrees of the vertices of a directed graph
- Parallel concepts in graph theory
- Partitions and Their Representative Graphs
Cited in
(20)- Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
- Potentially 2-connected integer pair sequences
- Matrices with prescribed row, column and block sums
- Characterization of unigraphic and unidigraphic integer-pair sequences
- \(r\)-multihypergraphs with prescribed edge degree sequences
- Connected realizations of joint-degree matrices
- Integer-pair sequences with self-complementary realizations
- On existence of hypergraphs with prescribed edge degree profile
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
- Graph realizations constrained by skeleton graphs
- Neighborhood degree lists of graphs
- A property of adjacency matrices of realizations of pair sequences
- Graphs and degree sequences. I
- On realizations of a joint degree matrix
- Rapid mixing of the switch Markov chain for 2-class joint degree matrices
- Exact sampling of graphs with prescribed degree correlations
- On the number of non-zero elements of joint degree vectors
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
- Degree polynomial for vertices in a graph and its behavior under graph operations
- Sequences of degrees of edges of self-complementary graphs
This page was built for publication: Relations between graphs and integer-pair sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1226508)
