scientific article; zbMATH DE number 2230266
From MaRDI portal
Publication:5708558
Cites work
- scientific article; zbMATH DE number 3906530 (Why is no real title available?)
- scientific article; zbMATH DE number 3912424 (Why is no real title available?)
- scientific article; zbMATH DE number 4043881 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 554161 (Why is no real title available?)
- scientific article; zbMATH DE number 734468 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 1124477 (Why is no real title available?)
- scientific article; zbMATH DE number 1145363 (Why is no real title available?)
- scientific article; zbMATH DE number 1156624 (Why is no real title available?)
- scientific article; zbMATH DE number 1472146 (Why is no real title available?)
- scientific article; zbMATH DE number 5856 (Why is no real title available?)
- scientific article; zbMATH DE number 861394 (Why is no real title available?)
- scientific article; zbMATH DE number 867682 (Why is no real title available?)
- scientific article; zbMATH DE number 867714 (Why is no real title available?)
- scientific article; zbMATH DE number 1439475 (Why is no real title available?)
- scientific article; zbMATH DE number 2197905 (Why is no real title available?)
- 1-tough cocomparability graphs are hamiltonian
- A 1-tough nonhamiltonian maximal planar graph
- A note on Hamiltonian circuits
- A theorem on tait colorings with an application to the generalized Petersen graphs
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- Chordality and 2-factors in tough graphs
- Connectivity, genus, and the number of components in vertex-deleted subgraphs
- Cycles containing many vertices of subsets in 1-tough graphs with large degree sums
- Finding Hamiltonian circuits in interval graphs
- Geometric algorithms and combinatorial optimization
- Graph Classes: A Survey
- Hamiltonian results inK1,3-free graphs
- Long Cycles in Digraphs
- Long cycles in graphs with large degree sums
- Maximum and minimum toughness of graphs of small genus
- More than one tough chordal planar graphs are Hamiltonian
- Not every 2-tough graph is Hamiltonian
- On Maximal Circuits in Finite Graphs
- On \(k\)-factor-critical graphs
- On submodular function minimization
- On the shortness exponent of 1-tough, maximal planar graphs
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
- Properties of edge-tough graphs
- Recognizing tough graphs is NP-hard
- Shortness exponents of families of graphs
- The complexity of recognizing tough cubic graphs
- The toughness of split graphs
- Tough graphs and Hamiltonian circuits.
- Toughness and edge-toughness
- Toughness and the existence of \(k\)-factors. III
- Toughness and the existence of k-factors. II
- Toughness and the existence ofk-factors
- Toughness, hamiltonicity and split graphs
- Toughness, minimum degree, and spanning cubic subgraphs
- Toughness, minimum degree, and the existence of 2‐factors
- Toughness, minimum degree, and the existence of 2‐factors
- Toughness, trees, and walks
- Various results on the toughness of graphs
- (2,k)-factor-critical graphs and toughness
- \((3, k)\)-factor-critical graphs and toughness
Cited in
(2)
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 Q5708558)
