scientific article; zbMATH DE number 3293646
From MaRDI portal
Publication:5576241
zbMath0184.27702MaRDI QIDQ5576241
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices, Unnamed Item, On the \(\ell\)-connectivity of a graph, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences, Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor, Pancyclic graphs and a conjecture of Bondy and Chvatal, Degree sequences and edge connectivity, On sufficient conditions for Hamiltonicity of graphs, and beyond, Degree sequence conditions for a graph to be disjoint path coverable, Best monotone degree conditions for binding number, Graphs and degree sequences. I, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Reciprocal degree distance and graph properties, Best monotone degree conditions for graph properties: a survey, On forcibly connected graphic sequences, Best monotone degree conditions for binding number and cycle structure, Toughness and Vertex Degrees, Designs with blocks of size two and applications to microarray experiments, On local connectivity of graphs, Spectral conditions for some graphical properties, Sufficient conditions for a graph to be Hamiltonian, A method in graph theory, Tough graphs and Hamiltonian circuits. (Reprint), Panconnected graphs. II, Sufficient degree conditions fork-edge-connectedness of a graph, Some sufficient conditions on \(k\)-connected graphs, Some topological indices and graph properties, Graph theory, 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, On distance local connectivity and the Hamiltonian index, The maximum size of a nonhamiltonian graph with given order and connectivity, On the necessity of Chvátal’s Hamiltonian degree condition, Wiener-type invariants on graph properties, Two theorems on Hamiltonian graphs, A generalization of a theorem of Nash-Williams, A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected
