scientific article; zbMATH DE number 2230266
From MaRDI portal
Publication:5708558
zbMATH Open1075.05559MaRDI QIDQ5708558FDOQ5708558
Authors: E. Schmeichel, D. Bauer, Hajo Broersma 
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Graph Classes: A Survey
- A note on Hamiltonian circuits
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Hamiltonian results inK1,3-free graphs
- Title not available (Why is that?)
- Finding Hamiltonian circuits in interval graphs
- On submodular function minimization
- Toughness, hamiltonicity and split graphs
- Not every 2-tough graph is Hamiltonian
- Tough graphs and Hamiltonian circuits.
- More than one tough chordal planar graphs are Hamiltonian
- On \(k\)-factor-critical graphs
- On Maximal Circuits in Finite Graphs
- Long cycles in graphs with large degree sums
- The complexity of recognizing tough cubic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Toughness, trees, and walks
- Title not available (Why is that?)
- Shortness exponents of families of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognizing tough graphs is NP-hard
- Long Cycles in Digraphs
- Title not available (Why is that?)
- Toughness and the existence ofk-factors
- Toughness, minimum degree, and the existence of 2‐factors
- 1-tough cocomparability graphs are hamiltonian
- A 1-tough nonhamiltonian maximal planar graph
- The toughness of split graphs
- On the shortness exponent of 1-tough, maximal planar graphs
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- Title not available (Why is that?)
- Chordality and 2-factors in tough graphs
- Title not available (Why is that?)
- \((2,k)\)-factor-critical graphs and toughness
- Toughness and the existence of k-factors. II
- Toughness and the existence of \(k\)-factors. III
- Toughness and edge-toughness
- Connectivity, genus, and the number of components in vertex-deleted subgraphs
- Title not available (Why is that?)
- \((3, k)\)-factor-critical graphs and toughness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum and minimum toughness of graphs of small genus
- Title not available (Why is that?)
- Cycles containing many vertices of subsets in 1-tough graphs with large degree sums
- Toughness, minimum degree, and the existence of 2‐factors
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
- Properties of edge-tough graphs
- Various results on the toughness of graphs
- Toughness, minimum degree, and spanning cubic subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
