A criterion for planarity of the square of a graph
From MaRDI portal
Publication:5534026
DOI10.1016/S0021-9800(67)80050-4zbMATH Open0153.25902MaRDI QIDQ5534026FDOQ5534026
Frank Harary, Richard Karp, William T. Tutte
Publication date: 1967
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
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
- Square roots of minor closed graph classes
- Finding cactus roots in polynomial time
- 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
- Finding cut-vertices in the square roots of a graph
- Square roots of minor closed graph classes
- 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)
