Alexander Clifton
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alexander Clifton has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Bahareh Afshari
University of Gothenburg
1 shared publication - Balázs Patkós
Alfréd Rényi Institute of Mathematics, Hungary
1 shared publication - Bill Jackson
School of Mathematical Sciences Queen Mary University of London Mile End Road E1 4NS London United Kingdom
1 shared publication Bo-Ram Park
C/O The Sheridan Press, PO Box 465, Hanover, PA 17331 USA
1 shared publication- Calum Buchanan
University of Vermont,Dept. of Mathematics Statistics,Burlington,VT,USA
1 shared publication - Dieter Rautenbach
Ulm University
1 shared publication
Latest Publications
- Open Access
- 7 August 2026
- Published by Wiley in Journal of Graph Theory
Saturated Partial Embeddings of Planar Graphs
In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph , we say that a plane subgraph is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to would either violate planarity or make the resulting graph no longer a subgraph of . For a planar graph , we define the plane‐saturation ratio , , as the minimum value of for a plane‐saturated subgraph of and investigate how small can be. While there exist planar graphs where is arbitrarily close to 0, we show that for all twin‐free planar graphs, , and that there exist twin‐free planar graphs where is arbitrarily close to 1/16. We study a broader category of planar graphs, focusing on classes characterized by a bounded number of degree 1 and degree 2 twin vertices. We offer solutions for some instances of bounds while positing conjectures for the remaining ones.
- 7 August 2026
- Published by Wiley in Journal of Graph Theory
Open AccessSaturated Partial Embeddings of Planar Graphs
In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph , we say that a plane subgraph is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to would either violate planarity or make the resulting graph no longer a subgraph of . For a planar graph , we define the plane‐saturation ratio , , as the minimum value of for a plane‐saturated subgraph of and investigate how small can be. While there exist planar graphs where is arbitrarily close to 0, we show that for all twin‐free planar graphs, , and that there exist twin‐free planar graphs where is arbitrarily close to 1/16. We study a broader category of planar graphs, focusing on classes characterized by a bounded number of degree 1 and degree 2 twin vertices. We offer solutions for some instances of bounds while positing conjectures for the remaining ones.
- 22 February 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (5)
New bounds on diffsequences
- 22 February 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (5)
New bounds on diffsequences
- Open Access
- 24 August 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 104 (2) , 257-260
Issue Information
- 24 August 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 104 (2) , 257-260
Open AccessIssue Information