Conditions for graphs to be path partition optimal (Q1709536): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2018.02.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2793133492
@@ Property / OpenAlex ID: W2793133492 / rank @@
+Normal rank
@@ Property / cites work @@
+A remark on two sufficient conditions for Hamilton cycles
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Hamiltonian circuits
@@ Property / cites work: A note on Hamiltonian circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Degree conditions on induced claws
@@ Property / cites work: Degree conditions on induced claws / rank @@
+Normal rank
@@ Property / cites work @@
+Q3918148
@@ Property / cites work: Q3918148 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden pairs for hamiltonian properties
+Normal rank
@@ Property / cites work @@
+Q4050641
@@ Property / cites work: Q4050641 / rank @@
+Normal rank
@@ Property / cites work @@
+Heavy subgraph pairs for traceability of block-chains
+Normal rank
@@ Property / cites work @@
+Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q130194299
@@ Property / Wikidata QID: Q130194299 / rank @@
+Normal rank