Hamiltonian cycles with all small even chords (Q409469): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C45
@@ Property / Mathematics Subject Classification ID: 05C45 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6023660
@@ Property / zbMATH DE Number: 6023660 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Hamiltonian cycle
@@ Property / zbMATH Keywords: Hamiltonian cycle / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Dirac theorem
@@ Property / zbMATH Keywords: Dirac theorem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Posa's conjecture
@@ Property / zbMATH Keywords: Posa's conjecture / 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.1016/j.disc.2011.12.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2060106501
@@ Property / OpenAlex ID: W2060106501 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Arbitrary Graphs of Maximum Degree Two
@@ Property / cites work: Embedding Arbitrary Graphs of Maximum Degree Two / rank @@
+Normal rank
@@ Property / cites work @@
+-factors in dense graphs
@@ Property / cites work: 2-factors in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of the bandwidth conjecture of Bollobás and Komlós
+Normal rank
@@ Property / cites work @@
+Pósa's conjecture for graphs of order at least 2 × 10<sup>8</sup>
+Normal rank
@@ Property / cites work @@
+-factors in dense bipartite graphs
@@ Property / cites work: 2-factors in dense bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / 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 @@
+On circuits in graphs
@@ Property / cites work: On circuits in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5520566
@@ Property / cites work: Q5520566 / rank @@
+Normal rank
@@ Property / cites work @@
+The square of paths and cycles
@@ Property / cites work: The square of paths and cycles / 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 @@
+The Blow-up Lemma
@@ Property / cites work: The Blow-up Lemma / rank @@
+Normal rank
@@ Property / cites work @@
+On the square of a Hamiltonian cycle in dense graphs
+Normal rank
@@ Property / cites work @@
+Blow-up lemma
@@ Property / cites work: Blow-up lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Q4242960
@@ Property / cites work: Q4242960 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of the Seymour conjecture for large graphs
@@ Property / cites work: Proof of the Seymour conjecture for large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4878666
@@ Property / cites work: Q4878666 / rank @@
+Normal rank
@@ Property / cites work @@
+On a problem of K. Zarankiewicz
@@ Property / cites work: On a problem of K. Zarankiewicz / rank @@
+Normal rank
@@ Property / cites work @@
+How to avoid using the regularity Lemma: Pósa's conjecture revisited
+Normal rank
@@ Property / cites work @@
+Q5628163
@@ Property / cites work: Q5628163 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q4200109
@@ Property / cites work: Q4200109 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:409469