Pages that link to "Item:Q1569072"

The following pages link to Equivalence of Fleischner's and Thomassen's conjectures (Q1569072):

Displaying 11 items.

• Hamilton cycles in 5-connected line graphs (Q412285) (← links)
• How many conjectures can you stand? A survey (Q659764) (← links)
• On embeddings of snarks in the torus (Q952646) (← links)
• Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks (Q998345) (← links)
• A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs (Q998464) (← links)
• On the dominating (induced) cycles of iterated line graphs (Q2104921) (← links)
• Circumference of a graph and its distance dominating longest cycles (Q2214043) (← links)
• Equivalence of Jackson's and Thomassen's conjectures (Q2349510) (← links)
• Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038) (← links)
• The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs (Q3439419) (← links)
• Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks (Q3439565) (← links)