On a cycle through a specified linear forest of a graph (Q868359): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2005.11.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2019434459
@@ Property / OpenAlex ID: W2019434459 / rank @@
+Normal rank
@@ Property / cites work @@
+Menger's Theorem
@@ Property / cites work: Menger's Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles through subsets with large degree sums
@@ Property / cites work: Cycles through subsets with large degree sums / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
+Normal rank
@@ Property / cites work @@
+Circuits through specified edges
@@ Property / cites work: Circuits through specified edges / rank @@
+Normal rank
@@ Property / cites work @@
+On paths and cycles through specified vertices
@@ Property / cites work: On paths and cycles through specified vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles through a linear forest
@@ Property / cites work: Long cycles through a linear forest / rank @@
+Normal rank
@@ Property / cites work @@
+One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
+Normal rank
@@ Property / cites work @@
+Cycles and Connectivity in Graphs
@@ Property / cites work: Cycles and Connectivity in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Circuits containing specified edges
@@ Property / cites work: Circuits containing specified edges / rank @@
+Normal rank