Minimum degree conditions for $H$-linked graphs (Q947099): 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.1016/j.dam.2006.11.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2098792571
@@ Property / OpenAlex ID: W2098792571 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint cycles containing specified edges
@@ Property / cites work: Vertex-disjoint cycles containing specified edges / rank @@
+Normal rank
@@ Property / cites work @@
+Onk-ordered graphs
@@ Property / cites work: Onk-ordered graphs / 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 @@
+On Sufficient Degree Conditions for a Graph to be $k$-linked
+Normal rank
@@ Property / cites work @@
+Onk-ordered Hamiltonian graphs
@@ Property / cites work: Onk-ordered Hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An extremal problem for <i>H</i>‐linked graphs
@@ Property / cites work: An extremal problem for <i>H</i>‐linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+k-ordered Hamiltonian graphs
@@ Property / cites work: k-ordered Hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An improved linear edge bound for graph linkages
@@ Property / cites work: An improved linear edge bound for graph linkages / rank @@
+Normal rank

Minimum degree conditions for \(H\)-linked graphs (Q947099): Difference between revisions

Latest revision as of 17:48, 28 June 2024

Statements

Sitelinks

Mathematics(1 entry)