planar_graphs generator: support minimum_connectivity=4 #41229
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Ordoviz
force-pushed
the
support-more-plantri-options
branch
from
abaa727 to
ed67c60
Compare
Contributor
Author
|
I just reformatted the doctests to fit into 80 columns. |
Contributor
|
Thanks. LGTM |
vbraun
pushed a commit
to vbraun/sage
that referenced
this pull request
Dec 1, 2025
sagemathgh-41229: planar_graphs generator: support minimum_connectivity=4 plantri supports `-pc4` since version 5.0 released on October 2, 2016 but the [`planar_graphs()`](https://doc.sagemath.org/html/en/reference/g raphs/sage/graphs/graph_generators.html#sage.graphs.graph_generators.Gra phGenerators.planar_graphs) generator incorrectly claimed that `minimum_connectivity=4` was not supported. This pull request rectifies that. I also tried adding support for a more broad range of options to the `triangulations()` generator but I found it difficult to deal with the complex requirements between the various parameters. According to its README, plantri supports the following options, but not all combinations are allowed: ``` Planar triangulations connectivity 1, 2, 3, 4 or 5 minimum degree 3, 4 or 5 eulerian with connectivity 3 or 4 Planar quadrangulations arbitrary simple 3-connected minimum degree 3 and simple 3-connected, no non-facial 4-cycles arbitrary Planar simple graphs connectivity 1, 2, 3 or 4 minimum degree 1, 2, 3, 4 or 5 Planar simple bipartite graphs connectivity 1, 2 or 3 minimum degree 1, 2, or 3 Triangulations of a disk connectivity 2 or 3 minimum degree 2 or 3 Planar cubic graphs connectivity 1, 2, or 3 connectivity 1, 2, or 3 girth 3, 4 or 5 cyclic connectivity 3, 4 or 5 bipartite with cyclic connectivity 3 or 4 Planar quartic graphs 3-connected simple 4-edge-connected simple 4-edge-connected 3-connected, 6-cyclically-edge-connected arbitrary ``` URL: sagemath#41229 Reported by: Lennard Hofmann Reviewer(s):
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
plantri supports
-pc4since version 5.0 released on October 2, 2016 but theplanar_graphs()generator incorrectly claimed thatminimum_connectivity=4was not supported. This pull request rectifies that.I also tried adding support for a more broad range of options to the
triangulations()generator but I found it difficult to deal with the complex requirements between the various parameters. According to its README, plantri supports the following options, but not all combinations are allowed: