相关论文: A sufficient condition for a pair of sequences to …

There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality…

We give a sufficient condition for a degree sequence to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.

We give a sharp refinement of a result of Alon, Ben-Shimon and Krivelevich. This gives a sufficient condition for a finite sequence of positive integers to be the vertex degree list of both parts of a bipartite graph. The condition depends…

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected.

This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under which a sequence is necessarily connected i.e. the sequence…

The degree sequence of a graph is the sequence of the degrees of its vertices. If $\pi$ is a degree sequence of a graph $G$, then $G$ is a realization of $\pi$ and $G$ realizes $\pi$. Determining when a sequence of positive integers is…

This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these…

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…

For many types of graphs, criteria have been discovered that give necessary and sufficient conditions for an integer sequence to be the degree sequence of such a graph. These criteria tend to take the form of a set of inequalities, and in…

We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…

We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…

Let s<t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n=k(s+t), which ensure that G has a K_{s,t}-factor. Exact result for large n is given. Our…

There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

Assume that we are given two graphic sequences, $\pi_1$ and $\pi_2$. We consider conditions for $\pi_1$ and $\pi_2$ which guarantee that there exists a simple graph $G_2$ realizing $\pi_2$ such that $G_2$ is the subgraph of any simple graph…

The graph packing problem is a well-known area in graph theory. We consider a bipartite version and give almost tight conditions on the packability of two bipartite sequences.

For a finite sequence of positive integers to be the degree sequence of a finite graph, Zverovich and Zverovich gave a sufficient condition involving only the length of the sequence, its maximal element and its minimal element. In this…

As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is presented to test whether an arbitrary graphical degree sequence has a bipartite realization. The algorithm can be configured to run in…

A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices in the two parts. The perfect matching condition and…

A bihole in a bipartite graph $G$ with partite sets $A$ and $B$ is an independent set $I$ in $G$ with $|I\cap A|=|I\cap B|$. We prove lower bounds on the largest order of biholes in balanced bipartite graphs subject to conditions involving…