Pith. sign in

REVIEW 1 cited by

On planar regular graphs degree three without Hamiltonian cycles

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0908.2563 v1 pith:DGNUFQRL submitted 2009-08-18 math.CO

Emanuels Grinbergs (IMCS) This is my paper · ORCID
classification math.CO
keywords hamiltonianplanarcycledegreegraphsregularthreewithout
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Necessary condition to have Hamiltonian cycle in planar graph is given. Examples of regular planar graphs degree three without Hamiltonian cycle are built.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Complexity and Geometry of Sampling Connected Graph Partitions

    cs.CC 2019-08 accept novelty 7.0 of 10

    Uniform and balanced sampling of connected planar graph partitions is hard unless RP=NP, the flip walk mixes exponentially slowly on explicit triangulation families, and tractable cases include series-parallel and bou...

Pith tools