The Hamiltonian properties in \(K_{1,r}\)-free split graphs (Q2124619): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2022.112826
@@ Property / DOI: 10.1016/j.disc.2022.112826 / rank @@
-Normal rank
@@ Property / author @@
-Hajo J. Broersma
@@ Property / author: Hajo J. Broersma / rank @@
-Normal rank
@@ Property / author @@
+Hajo J. Broersma
@@ Property / author: Hajo J. Broersma / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q114190548
@@ Property / Wikidata QID: Q114190548 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2022.112826
+Normal rank
@@ Property / OpenAlex ID @@
+W4283399124
@@ Property / OpenAlex ID: W4283399124 / rank @@
+Normal rank
@@ Property / cites work @@
+The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
+Normal rank
@@ Property / cites work @@
+On some intriguing problems in Hamiltonian graph theory---a survey
+Normal rank
@@ Property / cites work @@
+How many conjectures can you stand? A survey
@@ Property / cites work: How many conjectures can you stand? A survey / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Hamiltonian split graphs
@@ Property / cites work: A note on Hamiltonian split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden pairs for \(k\)-connected Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / 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 @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Split Graphs Having Dilworth Number Two
@@ Property / cites work: Split Graphs Having Dilworth Number Two / rank @@
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Updating the hamiltonian problem—A survey
@@ Property / cites work: Updating the hamiltonian problem—A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Advances on the Hamiltonian problem -- a survey
@@ Property / cites work: Advances on the Hamiltonian problem -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey on Hamiltonian Cycles
@@ Property / cites work: A Survey on Hamiltonian Cycles / 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 @@
+Split graphs
@@ Property / cites work: Split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Burkard-Hammer condition for Hamiltonian split graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2022.112826
@@ Property / DOI: 10.1016/J.DISC.2022.112826 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2124619