Hamiltonian cycles in <i>n</i>‐extendable graphs (Q4539871): Difference between revisions

@@ 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.10050
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.10050 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2083062729
@@ Property / OpenAlex ID: W2083062729 / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in graphs with large degree sums
@@ Property / cites work: Long cycles in graphs with large degree sums / rank @@
+Normal rank
@@ Property / cites work @@
+Degree sums, \(k\)-factors and Hamilton cycles in graphs
+Normal rank
@@ Property / cites work @@
+On Maximal Circuits in Finite Graphs
@@ Property / cites work: On Maximal Circuits in Finite Graphs / rank @@
+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 @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+On n-extendable graphs
@@ Property / cites work: On n-extendable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The binding number of a graph and its Anderson number
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4539871