Matches in DBpedia 2015-10 for { <http://doi.org/10.1016/S0166-218X(99)00141-9> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- S0166-218X(99)00141-9 contribution "Not every 2-tough graph is Hamiltonian".
- S0166-218X(99)00141-9 department "Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization".
- S0166-218X(99)00141-9 doi "10.1016/S0166-218X00141-9".
- S0166-218X(99)00141-9 edition "1-3".
- S0166-218X(99)00141-9 first1 "D.".
- S0166-218X(99)00141-9 first2 "H. J.".
- S0166-218X(99)00141-9 first3 "H. J.".
- S0166-218X(99)00141-9 isCitedBy Fleischners_theorem.
- S0166-218X(99)00141-9 isCitedBy Graph_toughness.
- S0166-218X(99)00141-9 journal Discrete_Applied_Mathematics.
- S0166-218X(99)00141-9 journal "Discrete Applied Mathematics".
- S0166-218X(99)00141-9 last1 "Bauer".
- S0166-218X(99)00141-9 last2 "Broersma".
- S0166-218X(99)00141-9 last3 "Veldman".
- S0166-218X(99)00141-9 mr "1743840".
- S0166-218X(99)00141-9 pages "317–321".
- S0166-218X(99)00141-9 title "Not every 2-tough graph is Hamiltonian".
- S0166-218X(99)00141-9 title "Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization".
- S0166-218X(99)00141-9 volume "99".
- S0166-218X(99)00141-9 year "2000".