How many conjectures can you stand? A survey (Q659764): Difference between revisions

@@ Property / OpenAlex ID @@
+W2142881856
@@ Property / OpenAlex ID: W2142881856 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q123359474
@@ Property / Wikidata QID: Q123359474 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles in graphs. (Workshop ''Cycles in Graphs'' held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
+Normal rank
@@ Property / cites work @@
+Q5187317
@@ Property / cites work: Q5187317 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, minimum degree, and the existence of 2‐factors
+Normal rank
@@ Property / cites work @@
+Not every 2-tough graph is Hamiltonian
@@ Property / cites work: Not every 2-tough graph is Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of derived graphs
@@ Property / cites work: Characterizations of derived graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles in digraphs– a survey
@@ Property / cites work: Cycles in digraphs– a survey / rank @@
+Normal rank
@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete
@@ Property / cites work: The edge Hamiltonian path problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+A method in graph theory
@@ Property / cites work: A method in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Generation and properties of snarks
@@ Property / cites work: Generation and properties of snarks / rank @@
+Normal rank
@@ Property / cites work @@
+On some intriguing problems in Hamiltonian graph theory---a survey
+Normal rank
@@ Property / cites work @@
+Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
+Normal rank
@@ Property / cites work @@
+On factors of 4-connected claw-free graphs
@@ Property / cites work: On factors of 4-connected claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing sharp 2-factors in claw-free graphs
@@ Property / cites work: Computing sharp 2-factors in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Strengthening the closure concept in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Closure concepts: A survey
@@ Property / cites work: Closure concepts: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+A reduction method to find spanning Eulerian subgraphs
+Normal rank
@@ Property / cites work @@
+Supereulerian graphs: A survey
@@ Property / cites work: Supereulerian graphs: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs without spanning closed trails
@@ Property / cites work: Graphs without spanning closed trails / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence ofk-factors
@@ Property / cites work: Toughness and the existence ofk-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Claw-free graphs---a survey
@@ Property / cites work: Claw-free graphs---a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q3220629
@@ Property / cites work: Q3220629 / rank @@
+Normal rank
@@ Property / cites work @@
+A note about the dominating circuit conjecture
@@ Property / cites work: A note about the dominating circuit conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+On some conjectures on cubic 3-connected graphs
@@ Property / cites work: On some conjectures on cubic 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Updating the hamiltonian problem—A survey
@@ Property / cites work: Updating the hamiltonian problem—A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Two-factors with few cycles in claw-free graphs
@@ Property / cites work: Two-factors with few cycles in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+Hamilton connectivity of line graphs and claw‐free graphs
+Normal rank
@@ Property / cites work @@
+Q2713641
@@ Property / cites work: Q2713641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4014627
@@ Property / cites work: Q4014627 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Sub-Eulerian Graphs
@@ Property / cites work: A Note on Sub-Eulerian Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in 5-connected line graphs
@@ Property / cites work: Hamilton cycles in 5-connected line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence of Fleischner's and Thomassen's conjectures
+Normal rank
@@ Property / cites work @@
+Equivalences between Hamiltonicity and flow conjectures, and the sublinear defect property
+Normal rank
@@ Property / cites work @@
+All 4-connected line graphs of claw free graphs are Hamiltonian connected
+Normal rank
@@ Property / cites work @@
+Bounds of the number of disjoint spanning trees
@@ Property / cites work: Bounds of the number of disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
+Normal rank
@@ Property / cites work @@
+Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
+Normal rank
@@ Property / cites work @@
+Every 4-connected line graph of a planar graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Every 3-connected, essentially 11-connected line graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
+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 @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4304397
@@ Property / cites work: Q4304397 / rank @@
+Normal rank
@@ Property / cites work @@
+On a closure concept in claw-free graphs
@@ Property / cites work: On a closure concept in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Closure, 2-factors, and cycle coverings in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Contractibility techniques as a closure concept
@@ Property / cites work: Contractibility techniques as a closure concept / rank @@
+Normal rank
@@ Property / cites work @@
+On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
+Normal rank
@@ Property / cites work @@
+Q3129827
@@ Property / cites work: Q3129827 / rank @@
+Normal rank
@@ Property / cites work @@
+Reflections on graph theory
@@ Property / cites work: Reflections on graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+On dominating and spanning circuits in graphs
@@ Property / cites work: On dominating and spanning circuits in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonicity of 6-connected line graphs
@@ Property / cites work: Hamiltonicity of 6-connected line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On hamiltonian line graphs and connectivity
@@ Property / cites work: On hamiltonian line graphs and connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Circuit Double Covers of Graphs
@@ Property / cites work: Circuit Double Covers of Graphs / rank @@
+Normal rank