Pages that link to "Item:Q2558871"
From MaRDI portal
The following pages link to Tough graphs and Hamiltonian circuits. (Q2558871):
Displaying 50 items.
- 10-tough chordal graphs are Hamiltonian (extended abstract) (Q322253) (← links)
- Forbidden subgraphs for Hamiltonicity of 1-tough graphs (Q339484) (← links)
- 10-tough chordal graphs are Hamiltonian (Q345090) (← links)
- The spectrum and toughness of regular graphs (Q403562) (← links)
- Endpoint extendable paths in dense graphs (Q442374) (← links)
- Extreme tenacity of graphs with given order and size (Q489128) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- A toughness condition for a spanning tree with bounded total excesses (Q497366) (← links)
- Graph invariants and large cycles: a survey (Q539347) (← links)
- Extremal graphs with given order and the rupture degree (Q614351) (← links)
- On toughness and fractional \((g,f,n)\)-critical graphs (Q656581) (← links)
- Spanning trees: A survey (Q659663) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- On the higher-order edge toughness of a graph (Q686452) (← links)
- Some properties of \(k\)-trees (Q708399) (← links)
- The existence of \(k\)-factors in squares of graphs (Q712263) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties (Q763635) (← links)
- Toughness and prism-Hamiltonicity of \(P_4\)-free graphs (Q777381) (← links)
- Non-Hamiltonian 1-tough triangulations with disjoint separating triangles (Q777448) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630) (← links)
- Cyclability in graph classes (Q833007) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
- On toughness and \((g,f)\)-factors in bipartite graphs (Q861483) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
- \(k\)-factors and Hamilton cycles in graphs (Q884893) (← links)
- Realizability of Delaunay triangulations (Q911323) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- A simple proof of a theorem of Jung (Q918991) (← links)
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs (Q960979) (← links)
- Triangle-free graphs whose independence number equals the degree (Q960981) (← links)
- Vertex vulnerability parameters of Kronecker products of complete graphs (Q963383) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
- On 2-walks in chordal planar graphs (Q1043570) (← links)
- Hamiltonian paths in Cayley graphs (Q1044918) (← links)
- A look at cycles containing specified elements of a graph (Q1045026) (← links)
- Toughness and the existence of k-factors. II (Q1106860) (← links)
- Scattering number and extremal non-Hamiltonian graphs (Q1109047) (← links)
- On a connection between the existence of k-trees and the toughness of a graph (Q1120590) (← links)
- An upper bound on the shortness exponent of inscribable polytopes (Q1122592) (← links)
- A 1-tough nonhamiltonian maximal planar graph (Q1143414) (← links)
- A catalogue of small maximal nonhamiltonian graphs (Q1161757) (← links)
- A large class of maximally tough graphs (Q1182141) (← links)
- Hamiltonicity in claw-free graphs (Q1186134) (← links)
- Connectivity, genus, and the number of components in vertex-deleted subgraphs (Q1233441) (← links)
- On a class of posets and the corresponding comparability graphs (Q1247984) (← links)
- Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831) (← links)
