Listing spanning trees of outerplanar graphs by pivot-exchanges
Fuente:
arXiv
Saved in:
| Main Authors: | Behrooznia, Nastaran, Mütze, Torsten |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)
by: Mütze, Torsten, et al.
Published: (2024)
Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)
by: Gregor, Petr, et al.
Published: (2023)
Combinatorial Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022)
by: Mütze, Torsten
Published: (2022)
Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024)
by: Acharya, Rohan, et al.
Published: (2024)
On minimum Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)
by: Brenner, Sofia, et al.
Published: (2025)
Disjunctive domination in maximal outerplanar graphs
by: Henning, Michael A., et al.
Published: (2025)
by: Henning, Michael A., et al.
Published: (2025)
Traversing combinatorial 0/1-polytopes via optimization
by: Merino, Arturo, et al.
Published: (2023)
by: Merino, Arturo, et al.
Published: (2023)
Disproving two conjectures on the Hamiltonicity of Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)
by: Brenner, Sofia, et al.
Published: (2025)
A complete $t$-intersection theorem for families of spanning trees
by: Iarovikova, Elizaveta, et al.
Published: (2025)
by: Iarovikova, Elizaveta, et al.
Published: (2025)
tinygarden -- A java package for testing properties of spanning trees
by: Dubinsky, Manuel, et al.
Published: (2024)
by: Dubinsky, Manuel, et al.
Published: (2024)
Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)
by: Goedgebeur, Jan, et al.
Published: (2025)
On the complexity of finding a spanning even tree in a graph
by: Hanaka, Tesshu, et al.
Published: (2024)
by: Hanaka, Tesshu, et al.
Published: (2024)
List homomorphisms to separable signed graphs
by: Bok, Jan, et al.
Published: (2023)
by: Bok, Jan, et al.
Published: (2023)
On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)
by: Kaul, Neel, et al.
Published: (2025)
List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)
by: Piecyk, Marta, et al.
Published: (2025)
Localization game capture time of trees and outerplanar graphs
by: Chenoweth, Vesna Iršič, et al.
Published: (2025)
by: Chenoweth, Vesna Iršič, et al.
Published: (2025)
Rainbow copies of spanning subgraphs
by: Cooper, Colin, et al.
Published: (2025)
by: Cooper, Colin, et al.
Published: (2025)
Edge densities of drawings of graphs with one forbidden cell
by: Hahn, Benedikt, et al.
Published: (2025)
by: Hahn, Benedikt, et al.
Published: (2025)
Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)
by: Beaudou, Laurent, et al.
Published: (2025)
Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)
by: Claus, Quentin, et al.
Published: (2026)
Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)
by: Davies, James, et al.
Published: (2025)
Large induced subgraph with a given pathwidth in outerplanar graphs
by: Matsumoto, Naoki, et al.
Published: (2025)
by: Matsumoto, Naoki, et al.
Published: (2025)
$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
Published: (2025)
by: Chakraborty, Dibyayan
Published: (2025)
Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
by: Ortlieb, Christian, et al.
Published: (2024)
by: Ortlieb, Christian, et al.
Published: (2024)
Rapid mixing of the flip chain over non-crossing spanning trees
by: Anand, Konrad, et al.
Published: (2024)
by: Anand, Konrad, et al.
Published: (2024)
A Note on Polychromatic Colorings of Shift-Chains
by: Ueckerdt, Torsten
Published: (2024)
by: Ueckerdt, Torsten
Published: (2024)
Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
by: Liu, Bowie, et al.
Published: (2025)
by: Liu, Bowie, et al.
Published: (2025)
A note on embracing exchange sequences in oriented matroids
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)
by: Schneider, Samuel, et al.
Published: (2025)
The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)
by: Knauer, Kolja, et al.
Published: (2023)
The strong vertex span of trees
by: Grašič, Mateja, et al.
Published: (2024)
by: Grašič, Mateja, et al.
Published: (2024)
Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)
by: Beaton, Iain, et al.
Published: (2024)
Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)
by: Monti, Angelo, et al.
Published: (2024)
Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)
by: Berthe, Gaétan, et al.
Published: (2025)
Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)
by: Duron, Julien, et al.
Published: (2024)
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)
by: Foucaud, Florent, et al.
Published: (2024)
How to see the forest for the trees
by: Bérczi-Kovács, Erika, et al.
Published: (2025)
by: Bérczi-Kovács, Erika, et al.
Published: (2025)
Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)
by: de Lima, Paloma T., et al.
Published: (2025)
Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)
by: Goetze, Miriam, et al.
Published: (2024)
Similar Items
-
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024) -
Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023) -
Combinatorial Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022) -
Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024) -
On minimum Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)