We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvátal’s well-known degree condition for hamiltonicity is best possible
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Abstract We consider sufficient conditions for a degree sequence pi to be forcibly k-factor graphica...
We survey sufficient degree conditions, for a variety of graph properties, that are best possible in...
We survey sufficient degree conditions, for a variety of graph properties,\ud that are best possible...
AbstractWe give sufficient conditions on the vertex degrees of a graph G to guarantee that G has bin...
AbstractWe give sufficient conditions on the vertex degrees of a graph G to guarantee that G has bin...
AbstractIt is shown that Bondy's degree condition for n-connectedness of a graph is the strongest mo...
We consider sufficient conditions for a degree sequence pi to be forcibly k-factor graphical. We not...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
We consider sufficient conditions for a degree sequence $\pi$ to be forcibly $k$-factor graphical. W...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Abstract We consider sufficient conditions for a degree sequence pi to be forcibly k-factor graphica...
We survey sufficient degree conditions, for a variety of graph properties, that are best possible in...
We survey sufficient degree conditions, for a variety of graph properties,\ud that are best possible...
AbstractWe give sufficient conditions on the vertex degrees of a graph G to guarantee that G has bin...
AbstractWe give sufficient conditions on the vertex degrees of a graph G to guarantee that G has bin...
AbstractIt is shown that Bondy's degree condition for n-connectedness of a graph is the strongest mo...
We consider sufficient conditions for a degree sequence pi to be forcibly k-factor graphical. We not...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
We consider sufficient conditions for a degree sequence $\pi$ to be forcibly $k$-factor graphical. W...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Abstract We consider sufficient conditions for a degree sequence pi to be forcibly k-factor graphica...
DOI
Add to ORKG