On Toughness and Hamiltonicity of 2K2‐Free Graphs (Q5417820): Difference between revisions

@@ Property / author @@
-Q186095
@@ Property / author: Q186095 / rank @@
-Normal rank
@@ Property / author @@
-Artem V. Pyatkin
@@ Property / author: Artem V. Pyatkin / rank @@
-Normal rank
@@ Property / author @@
+Hajo J. Broersma
@@ Property / author: Hajo J. Broersma / rank @@
+Normal rank
@@ Property / author @@
+Artem V. Pyatkin
@@ Property / author: Artem V. Pyatkin / 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.1002/jgt.21734
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.21734 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1997628570
@@ Property / OpenAlex ID: W1997628570 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q55969520
@@ Property / Wikidata QID: Q55969520 / rank @@
+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 @@
+Recognizing tough graphs is NP-hard
@@ Property / cites work: Recognizing tough graphs is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4378526
@@ Property / cites work: Q4378526 / rank @@
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+-tough cocomparability graphs are hamiltonian
@@ Property / cites work: 1-tough cocomparability graphs are hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence ofk-factors
@@ Property / cites work: Toughness and the existence ofk-factors / rank @@
+Normal rank
@@ Property / cites work @@
+On diameters and radii of bridged graphs
@@ Property / cites work: On diameters and radii of bridged graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tough spiders
@@ Property / cites work: Tough spiders / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian circuits in interval graphs
@@ Property / cites work: Finding Hamiltonian circuits in interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, hamiltonicity and split graphs
@@ Property / cites work: Toughness, hamiltonicity and split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets in extensions of 2\(K_{2}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Necessary conditions for Hamiltonian split graphs
@@ Property / cites work: Necessary conditions for Hamiltonian split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4390654
@@ Property / cites work: Q4390654 / rank @@
+Normal rank
@@ Property / cites work @@
+Existence of dominating cycles and paths
@@ Property / cites work: Existence of dominating cycles and paths / rank @@
+Normal rank
@@ Property / cites work @@
+The toughness of split graphs
@@ Property / cites work: The toughness of split graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5417820

On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs (Q5417820): Difference between revisions

Latest revision as of 12:40, 8 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)