Pancyclicity and NP-completeness in planar graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(11)- Global cycle properties of locally isometric graphs
- Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs
- Global cycle properties in graphs with large minimum clustering coefficient
- Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
- Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
- Deciding whether a planar graph has a cubic subgraph is NP-complete
- Pancyclicity in switching classes
- Exact algorithms for finding longest cycles in claw-free graphs
- The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs
- On Saito's conjecture and the Oberly-Sumner conjectures
- scientific article; zbMATH DE number 1504827 (Why is no real title available?)
This page was built for publication: Pancyclicity and NP-completeness in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962068)