On the Circumference of Essentially 4-connected Planar Graphs
Work
Year: 2020
Type: article
Abstract: A planar graph is essentially $4$-connected if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Jackson and Wormald proved that every essentially 4-connected pla... more
Cites:
Cited by: 2
Related to: 10
FWCI: 0.114
Citation percentile (by year/subfield): 50.13
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Sustainable cities and communities
Open Access status: diamond