summary:The minimum orders of degree-continuous graphs with prescribed degree sets were investigated by Gimbel and Zhang, Czechoslovak Math. J. 51 (126) (2001), 163–171. The minimum orders were not completely determined in some cases. In this note, the exact values of the minimum orders for these cases are obtained by giving improved upper bounds
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
AbstractLet C be a longest cycle in a connected graph G and L(G) the length of the longest path in G...
summary:The minimum orders of degree-continuous graphs with prescribed degree sets were investigated...
summary:A graph $G$ is degree-continuous if the degrees of every two adjacent vertices of $G$ differ...
summary:For a nontrivial connected graph $F$, the $F$-degree of a vertex $v$ in a graph $G$ is the n...
AbstractIt was proved by Chartrand that if G is a graph of order p for which the minimum degree is a...
The Erdős–Gallai criteria for recognizing degree sequences of simple graphs involve a system of ineq...
summary:For any nontrivial connected graph $F$ and any graph $G$, the {\it $F$-degree} of a vertex $...
AbstractNecessary and sufficient conditions for the existence of simple graphs with degrees from pre...
AbstractErdös and Gallai characterize in [3] the sequences of integers which are degree sequences of...
AbstractFor a finite simple graph G, we denote the set of degrees of its vertices, known as its degr...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
summary:The set $D$ of distinct signed degrees of the vertices in a signed graph $G$ is called its s...
By a graph G = (V,E) we mean a finite, undirected graph with neither loops nor multiple edges. The o...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
AbstractLet C be a longest cycle in a connected graph G and L(G) the length of the longest path in G...
summary:The minimum orders of degree-continuous graphs with prescribed degree sets were investigated...
summary:A graph $G$ is degree-continuous if the degrees of every two adjacent vertices of $G$ differ...
summary:For a nontrivial connected graph $F$, the $F$-degree of a vertex $v$ in a graph $G$ is the n...
AbstractIt was proved by Chartrand that if G is a graph of order p for which the minimum degree is a...
The Erdős–Gallai criteria for recognizing degree sequences of simple graphs involve a system of ineq...
summary:For any nontrivial connected graph $F$ and any graph $G$, the {\it $F$-degree} of a vertex $...
AbstractNecessary and sufficient conditions for the existence of simple graphs with degrees from pre...
AbstractErdös and Gallai characterize in [3] the sequences of integers which are degree sequences of...
AbstractFor a finite simple graph G, we denote the set of degrees of its vertices, known as its degr...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
summary:The set $D$ of distinct signed degrees of the vertices in a signed graph $G$ is called its s...
By a graph G = (V,E) we mean a finite, undirected graph with neither loops nor multiple edges. The o...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
AbstractLet C be a longest cycle in a connected graph G and L(G) the length of the longest path in G...
DOI
Add to ORKG