Pages that link to "Item:Q2457012"

The following pages link to Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices (Q2457012):

Displaying 9 items.

• Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
• (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
• A new characterization of matrices with the consecutive ones property (Q967442) (← links)
• Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
• Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
• All-shortest-path 2-interval routing is NP-complete (Q2380872) (← links)
• The parameterized complexity of stabbing rectangles (Q2428672) (← links)
• On the hardness of minimizing space for all-shortest-path interval routing schemes (Q2465642) (← links)
• Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)