A criterion for planarity of the square of a graph

DOI10.1016/S0021-9800(67)80050-4MaRDI QIDQ5534026zbMATH OpenFDO

Authors Frank Harary, Richard Karp, William T. Tutte

Publication date 1967

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0021-9800(67)80050-4

zbMATH Keywords

topology

Cited in

(11)

• Linear-time algorithms for tree root problems
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• Computing roots of graphs is hard
• Finding cactus roots in polynomial time
• Square roots of minor closed graph classes
• A remark on a problem of Harary
• Sulla tracciabilita' di grafi finiti su superficie compatte
• A linear kernel for finding square roots of almost planar graphs
• Square roots of minor closed graph classes
• Finding cut-vertices in the square roots of a graph
• Planar graphs with square or cube root are four colorable

This page was built for publication: A criterion for planarity of the square of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5534026)