Combinatorial generation via permutation languages. VI. Binary trees
Fuente:
arXiv
Saved in:
| Main Authors: | Gregor, Petr, Mütze, Torsten, Namrata |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| 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 Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022)
by: Mütze, Torsten
Published: (2022)
On minimum Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)
by: Brenner, Sofia, et al.
Published: (2025)
Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)
by: Behrooznia, Nastaran, et al.
Published: (2024)
Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024)
by: Acharya, Rohan, et al.
Published: (2024)
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)
Matchings in permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)
by: Inozemtsev, Eduard, et al.
Published: (2026)
Efficient counting of permutation patterns via double posets
by: Diehl, Joscha, et al.
Published: (2024)
by: Diehl, Joscha, et al.
Published: (2024)
Frankl's diversity theorem for permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)
by: Inozemtsev, Eduard, et al.
Published: (2026)
Forcing quasirandomness with 4-point permutations
by: Kráľ, Daniel, et al.
Published: (2024)
by: Kráľ, Daniel, et al.
Published: (2024)
An almost complete $t$-intersection theorem for permutations
by: Kupavskii, Andrey
Published: (2024)
by: Kupavskii, Andrey
Published: (2024)
Combinatorial Nullstellensatz Techniques
by: Freed, Daniel L.
Published: (2024)
by: Freed, Daniel L.
Published: (2024)
Computational and Combinatorial Results on Conflict-free Choosability
by: Gupta, Shiwali, et al.
Published: (2026)
by: Gupta, Shiwali, et al.
Published: (2026)
A Note on Polychromatic Colorings of Shift-Chains
by: Ueckerdt, Torsten
Published: (2024)
by: Ueckerdt, Torsten
Published: (2024)
Record-biased permutations and their permuton limit
by: Bouvel, Mathilde, et al.
Published: (2024)
by: Bouvel, Mathilde, et al.
Published: (2024)
Local generation of languages
by: Hoyrup, Mathieu
Published: (2025)
by: Hoyrup, Mathieu
Published: (2025)
Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
by: Lindeberg, Anna, et al.
Published: (2024)
by: Lindeberg, Anna, et al.
Published: (2024)
Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)
by: Knauer, Kolja, et al.
Published: (2023)
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)
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)
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)
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)
Upper Bounds on the Average Height of Random Binary Trees
by: Benkner, Louisa Seelbach
Published: (2024)
by: Benkner, Louisa Seelbach
Published: (2024)
Cops and Robber -- When Capturing is not Surrounding
by: Jungeblut, Paul, et al.
Published: (2023)
by: Jungeblut, Paul, et al.
Published: (2023)
Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)
by: Jungeblut, Paul, et al.
Published: (2022)
Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)
by: Goetze, Miriam, et al.
Published: (2024)
Edge densities of drawings of graphs with one forbidden cell
by: Hahn, Benedikt, et al.
Published: (2025)
by: Hahn, Benedikt, et al.
Published: (2025)
Partitioning a Planar Graph into two Triangle-Forests
by: Knauer, Kolja, et al.
Published: (2024)
by: Knauer, Kolja, et al.
Published: (2024)
Labeling and folding multi-labeled trees
by: Moulton, Vincent, et al.
Published: (2025)
by: Moulton, Vincent, et al.
Published: (2025)
Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
Conflict-free chromatic index of trees
by: Guo, Shanshan, et al.
Published: (2024)
by: Guo, Shanshan, et al.
Published: (2024)
Tree-partitions and small-spread tree-decompositions
by: Distel, Marc, et al.
Published: (2026)
by: Distel, Marc, et al.
Published: (2026)
On coarse tree decompositions and coarse balanced separators
by: Abrishami, Tara, et al.
Published: (2025)
by: Abrishami, Tara, et al.
Published: (2025)
Bipartite Turán number of paths and other trees
by: Bonamy, Marthe, et al.
Published: (2025)
by: Bonamy, Marthe, et al.
Published: (2025)
On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)
by: Kaul, Neel, 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)
Trade-off between spread and width for tree decompositions
by: Bodlaender, Hans L., et al.
Published: (2026)
by: Bodlaender, Hans L., et al.
Published: (2026)
Similar Items
-
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024) -
Combinatorial Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022) -
On minimum Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025) -
Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024) -
Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024)