Tough graphs and Hamiltonian circuits.

From MaRDI portal

Publication:2558871

Jump to:navigation, search

DOI10.1016/0012-365X(73)90138-6zbMath0256.05122WikidataQ29010657 ScholiaQ29010657MaRDI QIDQ2558871

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Long paths and toughness of \(k\)-trees and chordal planar graphs, Toughness of graphs and \([2,b\)-factors], Toughness and Hamiltonicity of a class of planar graphs, Cyclability in graph classes, Planar graphs, Hamilton cycles and extreme independence number, The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample, Tough Ramsey graphs without short cycles, An approximate max-flow min-cut relation for undirected multicommodity flow, with applications, Long cycles in graphs with prescribed toughness and minimum degree, Hamiltonian degree conditions for tough graphs, 10-tough chordal graphs are Hamiltonian (extended abstract), Graph-theoretical conditions for inscribability and Delaunay realizability, Maximum and minimum toughness of graphs of small genus, Claw-free graphs---a survey, Toughness and edge-toughness, Path partition number in tough graphs, Scattering number and modular decomposition, Binding number and toughness for matching extension, Toughness and the existence of k-factors. II, On a closure concept in claw-free graphs, Forbidden subgraphs for Hamiltonicity of 1-tough graphs, 1-tough cocomparability graphs are hamiltonian, Scattering number and extremal non-Hamiltonian graphs, Measuring the vulnerability for classes of intersection graphs, On toughness and \((g,f)\)-factors in bipartite graphs, 10-tough chordal graphs are Hamiltonian, Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs, The vulnerability of some networks including cycles via domination parameters, The toughness of cubic graphs, Graph factors and factorization: 1985--2003: a survey, Toughness and Hamiltonicity in \(k\)-trees, The complexity of recognizing tough cubic graphs, Toughness, hamiltonicity and split graphs, On a connection between the existence of k-trees and the toughness of a graph, On the shortness exponent of 1-tough, maximal planar graphs, An upper bound on the shortness exponent of inscribable polytopes, Better approximations of non-Hamiltonian graphs, A note on dominating cycles in 2-connected graphs, \(k\)-factors and Hamilton cycles in graphs, Extremal graphs with given order and the rupture degree, Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs, The spectrum and toughness of regular graphs, An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs, A 1-tough nonhamiltonian maximal planar graph, Toughness and \((a,b,k)\)-critical graphs, Realizability of Delaunay triangulations, Endpoint extendable paths in dense graphs, A catalogue of small maximal nonhamiltonian graphs, Recognizing tough graphs is NP-hard, A simple proof of a theorem of Jung, Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs, Not every 2-tough graph is Hamiltonian, Chordality and 2-factors in tough graphs, On toughness and fractional \((g,f,n)\)-critical graphs, Spanning trees: A survey, \(n\)-arc and \(n\)-circle connected graph-like spaces, On edge-rupture degree of graphs, A large class of maximally tough graphs, Extreme tenacity of graphs with given order and size, Best monotone degree conditions for graph properties: a survey, Hamiltonicity in claw-free graphs, A toughness condition for a spanning tree with bounded total excesses, Vulnerability of subclasses of chordal graphs, On approximating the longest path in a graph, On the higher-order edge toughness of a graph, Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs, Triangle-free graphs whose independence number equals the degree, Vertex vulnerability parameters of Kronecker products of complete graphs, Graph invariants and large cycles: a survey, Some properties of \(k\)-trees, The existence of \(k\)-factors in squares of graphs, Connectivity, genus, and the number of components in vertex-deleted subgraphs, Hamiltonian properties of polyhedra with few 3-cuts. A survey, On a class of posets and the corresponding comparability graphs, Bipartite toughness and \(k\)-factors in bipartite graphs, Hamiltonicity in graphs with few \(P_ 4\)'s, Degree sums, \(k\)-factors and Hamilton cycles in graphs, Expected value expansions in rooted graphs, Long cycles in graphs with large degree sums, Toughness of graphs and the existence of factors, Computing the binding number of a graph, Toughness and \([a, b\)-factors with inclusion\(/\)exclusion properties], Toughness and matching extension in graphs, On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs, A note on the approximability of the toughness of graphs, Toughness and prism-Hamiltonicity of \(P_4\)-free graphs, Non-Hamiltonian 1-tough triangulations with disjoint separating triangles, On 2-walks in chordal planar graphs, Bounds on the size of graphs of given order and \(l\)-connectivity, Hamiltonian paths in Cayley graphs, A look at cycles containing specified elements of a graph, Toughness and the existence of \(k\)-factors. III, The toughness of split graphs, 2-factors and Hamiltonicity, Hamiltonian powers in threshold and arborescent comparability graphs, On the length of longest dominating cycles in graphs, Toughness and Delaunay triangulations, A generalization of a result of Bauer and Schmeichel, On the complexity of recognizing tough graphs, An upper bound on the shortness exponent of 1-tough, maximal planar graphs, The Hamiltonian problem and \(t\)-path traceable graphs, Computing the Scattering Number of Graphs, Toughness of the corona of two graphs, The Hamiltonian properties in \(K_{1,r}\)-free split graphs, The maximum average connectivity among all orientations of a graph, Toughness and nonhamiltonicity of polyhedral graphs, Long paths and cycles in tough graphs, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs, VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS, RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS, Toughness and normalized Laplacian eigenvalues of graphs, Vulnerability Measures of Transformation Graph G^xy+, The scattering number of strictly chordal graphs: linear time determination, Hamilton cycles in line graphs of 3-hypergraphs, On hamiltonicity of 1-tough triangle-free graphs, On the toughness index of planar graphs, Local topological toughness and local factors, Separation of Cartesian products of graphs into several connected components by the removal of vertices, TENACITY OF TOTAL GRAPHS, The complexity of recognizing minimally tough graphs, Stability theorems for graph vulnerability parameters, Relationships between scattering number and other vulnerability parameters, The scattering number of thorn graphs, Toughness, binding number and restricted matching extension in a graph, A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks, The existence of \(P_{\geq3}\)-factor covered graphs, Tree robustness of a graph, On the Toughness of a Graph, Properties of minimally \(t\)-tough graphs, Robustness of random graphs based on graph spectra, The Chvátal-Erdős condition for prism-Hamiltonicity, A Remark on Hamiltonian Cycles, Hamiltonicities of double domination critical and stable claw-free graphs, Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs, A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs, RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS, The average lower reinforcement number of a graph, On the average lower bondage number of a graph, A polynomial algorithm for weighted scattering number in interval graphs, The average scattering number of graphs, Toughness for fractional \((2, b, k)\)-critical covered graphs, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, Hamiltonicity in Split Graphs - A Dichotomy, Graph toughness from Laplacian eigenvalues, Network robustness and residual closeness, Toughness, Hamiltonicity and spectral radius in graphs, Lower bounds for the Estrada index using mixing time and Laplacian spectrum, Recent advances on the Hamiltonian problem: survey III, Binding Number and Wheel Related Graphs, Tenacity of complete graph products and grids, The rupture degree of trees, Toughness in pseudo-random graphs, Pseudo-Hamiltonian-connected graphs, A simple method for resolving degeneracies in Delaunay triangulations, Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs, On the \(k\)-cut problem, Robustness of Regular Caterpillars, Link Vulnerability in Networks, BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS, On minimum 3-cuts and approximating k-cuts using Cut Trees, Maximum fractional factors in graphs, COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS, Toughness and the existence of fractional \(k\)-factors of graphs, Recognition of split-graphic sequences, On the Toughness of Cycle Permutation Graphs, Hamiltonian path saturated graphs with small size, Toughness in graphs -- a survey, Critical concepts in domination, A polynomial algorithm for computing the weak rupture degree of trees, A note on interconnecting matchings in graphs, 2-edge-Hamiltonian-connectedness of 4-connected plane graphs, On the neighbour-integrity of sequential joined graphs, Various results on the toughness of graphs, The toughness of Kneser graphs, A vulnerability parameter of networks, Hamiltonicity in Partly claw-free graphs, Toughness, forbidden subgraphs and pancyclicity, The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs, Implementation of RTO in a large hydrogen network considering uncertainty, Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs, On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations, Toughness, forbidden subgraphs, and Hamilton-connected graphs, A toughness condition for fractional \((k, m)\)-deleted graphs revisited, Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs, Robustness of regular ring lattices based on natural connectivity, Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs, An Ore-type condition for Hamiltonicity in tough graphs, A Proof of Brouwer's Toughness Conjecture, On the classification and toughness of generalized permutation star-graphs, Unnamed Item, Unnamed Item, \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs, Bounds for scattering number and rupture degree of graphs with genus, On the necessity of Chvátal’s Hamiltonian degree condition, Relationships between rupture degree and other parameters, The existence of path-factor covered graphs, Some results on path-factor critical avoidable graphs, Tree-core and tree-coritivity of graphs, On \(P_{\geq 3}\)-factor deleted graphs, Graph connectivity and binomial edge ideals, Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs, On agglomeration-based rupture degree in networks and a heuristic algorithm, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, Toughness and spanning trees in K4‐minor‐free graphs, Cycle lengths in randomly perturbed graphs, On the average lower bondage number of graphs under join and corona operations, Toughness and Hamiltonicity of strictly chordal graphs, Forbidden subgraphs and 2‐factors in 3/2‐tough graphs, ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs, Remarks on component factors, Assistance and interdiction problems on interval graphs, Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor, Isolated Rupture in Composite Networks, Sufficient conditions for graphs to have strong parity factors, Feasibility of data transmission under attack: from isolated toughness variant perspective, Residual closeness of graphs with given parameters, Computational complexity of network vulnerability analysis, Wiener index and vulnerability parameters of graphs, On the residual closeness of graphs with cut vertices, Isolated Rupture in Thorny Networks, Existence of 2-factors in tough graphs without forbidden subgraphs, Prime coprime graph of a finite group, Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs, The fully weighted toughness of a graph, Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs, An Ore-type condition for hamiltonicity in tough graphs and the extremal examples, A closure lemma for tough graphs and Hamiltonian degree conditions, ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS, Edmonds polytopes and weakly hamiltonian graphs, Unnamed Item, A Note on the Link Residual Closeness of Graphs Under Join Operation, Exponential Independence Number of Some Graphs, SOME RESULTS FOR THE RUPTURE DEGREE, On Toughness and Hamiltonicity of 2K₂‐Free Graphs, Partitioning vertices of 1-tough graphs into paths, Vulnerability parameters of split graphs, A large set of non-Hamiltonian graphs, Drawing graphs as spanners, Rupture degree of graphs, Unnamed Item, Unnamed Item, Chvátal’s t 0-Tough Conjecture, On the pancyclicity of 1-tough graphs, Toughness condition for a graph to be all fractional (g,f,n)-critical deleted, Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs, TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2558871&oldid=15316189"