Pages that link to "Item:Q5534026"
From MaRDI portal
The following pages link to A criterion for planarity of the square of a graph (Q5534026):
Displayed 11 items.
- Finding cactus roots in polynomial time (Q726100) (← links)
- Planar graphs with square or cube root are four colorable (Q1222655) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Square roots of minor closed graph classes (Q2442205) (← links)
- (Q2857427) (← links)
- Sulla tracciabilita' di grafi finiti su superficie compatte (Q3890713) (← links)
- A remark on a problem of Harary (Q5596082) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)