A criterion for planarity of the square of a graph
From MaRDI portal
Publication:5534026
DOI10.1016/S0021-9800(67)80050-4zbMath0153.25902MaRDI QIDQ5534026
Frank Harary, Richard M. Karp, William T. Tutte
Publication date: 1967
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
Long paths and toughness of \(k\)-trees and chordal planar graphs, Computing roots of graphs is hard, A linear kernel for finding square roots of almost planar graphs, Square roots of minor closed graph classes, Unnamed Item, Planar graphs with square or cube root are four colorable, A remark on a problem of Harary, Finding cut-vertices in the square roots of a graph, Finding cactus roots in polynomial time, Sulla tracciabilita' di grafi finiti su superficie compatte, Linear-time algorithms for tree root problems