scientific article; zbMATH DE number 6302995
From MaRDI portal
Publication:5419973
Recommendations
- Planar emulators conjecture is nearly true for cubic graphs
- Almost-linear ε -emulators for planar graphs
- Erdős-Gyárfás conjecture for cubic planar graphs
- Toward Cereceda's conjecture for planar graphs
- scientific article; zbMATH DE number 1138195
- On non-planarity of cubic graphs
- A planarity criterion for cubic bipartite graphs
- Farber's conjecture for planar graphs
- On cubic planar hypohamiltonian and hypotraceable graphs
- Cubic vertices in planar hypohamiltonian graphs
Cited in
(7)- How not to characterize planar-emulable graphs
- Planar emulators conjecture is nearly true for cubic graphs
- Towards finite characterization of planar-emulable non-projective graphs
- How not to characterize planar-emulable graphs
- scientific article; zbMATH DE number 975332 (Why is no real title available?)
- Almost-linear ε -emulators for planar graphs
- Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419973)
