Pancyclicity and NP-completeness in planar graphs
DOI10.1016/S0166-218X(99)00163-8zbMATH Open0939.05027DBLPjournals/dam/LiCM00OpenAlexW2008914847WikidataQ56235005 ScholiaQ56235005MaRDI QIDQ1962068FDOQ1962068
Authors: Eric Mendelsohn, Mingchu Li, Derek G. Corneil 
Publication date: 29 June 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00163-8
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)
Cites Work
Cited In (12)
- Global cycle properties of locally isometric graphs
- Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs
- Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
- Global cycle properties in graphs with large minimum clustering coefficient
- 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
- Title not available (Why is that?)
- On Saito's conjecture and the Oberly-Sumner conjectures
- Title not available (Why is that?)
- Turing kernelization for finding long paths and cycles in restricted graph classes
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)
