ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2006.11869
  4. Cited By
Planarity can be Verified by an Approximate Proof Labeling Scheme in
  Constant-Time
v1v2 (latest)

Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time

21 June 2020
G. Elek
ArXiv (abs)PDFHTML

Papers citing "Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time"

2 / 2 papers shown
Title
Local certification of graph decompositions and applications to
  minor-free classes
Local certification of graph decompositions and applications to minor-free classes
Nicolas Bousquet
Laurent Feuilloley
Théo Pierron
57
23
0
30 Jul 2021
Local Certification of Graphs with Bounded Genus
Local Certification of Graphs with Bounded Genus
Laurent Feuilloley
Pierre Fraigniaud
Pedro Montealegre
I. Rapaport
É. Rémila
Ioan Todinca
62
24
0
16 Jul 2020
1