Directory Home
Researchers
Departments
Publications
Projects
Activities
Datasets
Home
>
Research
> Browse
Research
Research at Lancaster
Researchers
Departments & Centres
Publications & Outputs
Projects
Activities
Datasets
Results for Planar graphs
Publications & Outputs
Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time
Elek, G.
,
31/10/2022
,
In:
Journal of Combinatorial Theory, Series A.
191
,
18 p.
, 105643.
Research output
:
Contribution to Journal/Magazine
›
Journal article
›
peer-review
A fast algorithm for minimum weight odd cuts and circuits in planar graphs
Letchford, A. N.
&
Pearson, N.
,
2005
,
In:
Operations Research Letters.
33
,
6
,
p. 625-628
4 p.
Research output
:
Contribution to Journal/Magazine
›
Journal article
›
peer-review