Pages that link to "Item:Q4161352"

The following pages link to Hamiltonian Cycles and Uniquely Edge Colourable Graphs (Q4161352):

Displaying 50 items.

• On purely tree-colorable planar graphs (Q280945) (← links)
• Circuit extension and circuit double cover of graphs (Q390272) (← links)
• On the size and structure of graphs with a constant number of 1-factors (Q418889) (← links)
• Enumeration of Hamiltonian cycles in certain generalized Petersen graphs (Q580371) (← links)
• Chords in longest cycles (Q684125) (← links)
• On existence theorems (Q686508) (← links)
• What is on his mind? (Q709300) (← links)
• Graphs uniquely Hamiltonian-connected from a vertex (Q790840) (← links)
• On the black-box complexity of Sperner's Lemma (Q839637) (← links)
• A data structure useful for finding Hamiltonian cycles (Q909446) (← links)
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
• Packing paths in complete graphs (Q965248) (← links)
• Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree (Q1024512) (← links)
• Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles (Q1045171) (← links)
• Parity results on connected f-factors (Q1076695) (← links)
• On common edges in optimal solutions to traveling salesman and other optimization problems (Q1105496) (← links)
• Faces with large diameter on the symmetric traveling salesman polytope (Q1200768) (← links)
• Spanning cycles of nearly cubic graphs (Q1250225) (← links)
• Some graphic uses of an even number of odd nodes (Q1296145) (← links)
• The complexity of finding a second Hamiltonian cycle in cubic graphs (Q1307702) (← links)
• On the complexity of the parity argument and other inefficient proofs of existence (Q1329155) (← links)
• Interchange graphs and the Hamiltonian cycle polytope (Q1382266) (← links)
• Independent dominating sets and a second hamiltonian cycle in regular graphs (Q1386422) (← links)
• 2-factor Hamiltonian graphs. (Q1403914) (← links)
• Vertices of small degree in uniquely Hamiltonian graphs (Q1569030) (← links)
• Hamiltonicity in locally finite graphs: two extensions and a counterexample (Q1658750) (← links)
• Hamilton cycles in infinite cubic graphs (Q1658776) (← links)
• Dual power assignment via second Hamiltonian cycle (Q1686228) (← links)
• Long cycles in Hamiltonian graphs (Q1717607) (← links)
• Rooted complete minors in line graphs with a Kempe coloring (Q1741595) (← links)
• Two conjectures on uniquely totally colorable graphs (Q1810627) (← links)
• The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges (Q1977262) (← links)
• 2-D Tucker is PPA complete (Q2009648) (← links)
• A PPA parity theorem about trees in a bipartite graph (Q2064287) (← links)
• From one to many rainbow Hamiltonian cycles (Q2102759) (← links)
• Cycles containing all the odd-degree vertices (Q2173434) (← links)
• A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685) (← links)
• Understanding PPA-completeness (Q2208253) (← links)
• Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
• The complexity of counting edge colorings for simple graphs (Q2232603) (← links)
• A parity theorem about trees with specified degrees (Q2235250) (← links)
• A short note on graphs with long Thomason chains (Q2237207) (← links)
• A note on kernels of intersecting families (Q2277266) (← links)
• Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs (Q2282481) (← links)
• On uniquely Hamiltonian claw-free and triangle-free graphs (Q2344006) (← links)
• Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
• On the Number of Hamiltonian Cycles in Bipartite Graphs (Q2785376) (← links)
• (Q2861567) (← links)
• Uniquely Hamiltonian Graphs of Minimum Degree 4 (Q2874097) (← links)
• Cycle Double Covers in Cubic Graphs having Special Structures (Q2922224) (← links)