Pages that link to "Item:Q497674"

The following pages link to Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674):

Displaying 12 items.

• Parameterized algorithms for finding square roots (Q262249) (← links)
• A unified approach to recognize squares of split graphs (Q313959) (← links)
• Finding cactus roots in polynomial time (Q726100) (← links)
• Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
• A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
• Computing square roots of graphs with low maximum degree (Q2413970) (← links)
• Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
• (Q2945204) (redirect page) (← links)
• (Q5136273) (← links)
• Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
• Graph square roots of small distance from degree one graphs (Q5918752) (← links)
• Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)