Pages that link to "Item:Q2413970"

The following pages link to Computing square roots of graphs with low maximum degree (Q2413970):

Displaying 12 items.

• Squares of low clique number (Q510991) (← links)
• Finding cactus roots in polynomial time (Q726100) (← links)
• Computing roots of graphs is hard (Q1336641) (← links)
• A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
• Square roots of minor closed graph classes (Q2442205) (← links)
• Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
• Square roots of minor closed graph classes (Q2857427) (← links)
• A Linear Kernel for Finding Square Roots of Almost Planar Graphs (Q5369506) (← links)
• (Q5389994) (← 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)
• Iterative roots with big graph (Q6483313) (← links)