Forbidden subgraphs for Hamiltonicity of 1-tough graphs (Q339484): Difference between revisions

@@ Property / DOI @@
-.7151/dmgt.1897
@@ Property / DOI: 10.7151/dmgt.1897 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C45
@@ Property / Mathematics Subject Classification ID: 05C45 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6651646
@@ Property / zbMATH DE Number: 6651646 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+forbidden subgraph
@@ Property / zbMATH Keywords: forbidden subgraph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+-tough graph
@@ Property / zbMATH Keywords: 1-tough graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(H\)-free graph
@@ Property / zbMATH Keywords: \(H\)-free graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Hamiltonian graph
@@ Property / zbMATH Keywords: Hamiltonian graph / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.7151/dmgt.1897
@@ Property / full work available at URL: https://doi.org/10.7151/dmgt.1897 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2531177258
@@ Property / OpenAlex ID: W2531177258 / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in graphs with prescribed toughness and minimum degree
+Normal rank
@@ Property / cites work @@
+Toughness in graphs -- a survey
@@ Property / cites work: Toughness in graphs -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Not every 2-tough graph is Hamiltonian
@@ Property / cites work: Not every 2-tough graph is Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+On some intriguing problems in Hamiltonian graph theory---a survey
+Normal rank
@@ Property / cites work @@
+On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden pairs for hamiltonian properties
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonian results inK1,3-free graphs
@@ Property / cites work: Hamiltonian results inK1,3-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Disconnected forbidden subgraphs, toughness and Hamilton cycles
+Normal rank
@@ Property / DOI @@
+.7151/DMGT.1897
@@ Property / DOI: 10.7151/DMGT.1897 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:339484