scientific article; zbMATH DE number 3293646

Cited in

(49)

On distance local connectivity and the Hamiltonian index
On the -connectivity of a graph
On forcibly connected graphic sequences
A method in graph theory
Panconnected graphs. II
Pancyclic graphs and a conjecture of Bondy and Chvatal
Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
Degree sequences and edge connectivity
Reciprocal degree distance and graph properties
Designs with blocks of size two and applications to microarray experiments
The maximum size of a nonhamiltonian graph with given order and connectivity
A generalization of a theorem of Nash-Williams
A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected
Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences
Sufficient conditions for a graph to be Hamiltonian
Some sufficient conditions on \(k\)-connected graphs
On local connectivity of graphs
Tough graphs and Hamiltonian circuits. (Reprint)
On Hamilton's ideals
Large cycles in graphs
Hamiltonian lines in infinite graphs with few vertices of smll valency
Note on Hamilton circuits and Hamilton paths
Tough graphs and Hamiltonian circuits.
The strongest monotone degree condition for \(n\)-connectedness of a graph
Degree sequence conditions for a graph to be disjoint path coverable
Sufficient degree conditions for k-edge-connectedness of a graph
Sufficient conditions for a graph to be k-edge-Hamiltonian, k-path-coverable, traceable and Hamilton-connected
Graphs and degree sequences. I
Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
Best monotone degree conditions for graph properties: a survey
Toughness and vertex degrees
Best monotone degree conditions for binding number and cycle structure
On the necessity of Chvátal's Hamiltonian degree condition
Wiener-type invariants on graph properties
Some topological indices and graph properties
Spectral conditions for some graphical properties
Graph theory
On sufficient conditions for Hamiltonicity of graphs, and beyond
Best monotone degree conditions for binding number
Pósa-type results for Berge hypergraphs
Results on the vertex connectivity of hypergraphs
On forcibly k-connected uniform hypergraphic sequences
Maximizing the number of stars in graphs with forbidden properties
Degree conditions for disjoint path covers in graphs
Several graph properties in terms of the multiplicative version of the first Zagreb index
On sufficient degree conditions for a graph to be disjoint path coverable
Two theorems on Hamiltonian graphs
Maximally edge-connected and vertex-connected graphs and digraphs: A survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576241)