Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.06869 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Branch-depth is minor closure of contraction-deletion-depth
by: Briański, Marcin, et al.
Published: (2024)
by: Briański, Marcin, et al.
Published: (2024)
Twin-width of graphs on surfaces
by: Kráľ, Daniel, et al.
Published: (2023)
by: Kráľ, Daniel, et al.
Published: (2023)
Closure property of contraction-depth of matroids
by: Brianski, Marcin, et al.
Published: (2023)
by: Brianski, Marcin, et al.
Published: (2023)
Reconfiguring Graph Homomorphisms on the Sphere
by: Lee, Jae-Baek, et al.
Published: (2018)
by: Lee, Jae-Baek, et al.
Published: (2018)
Six Permutation Patterns Force Quasirandomness
by: Crudele, Gabriel, et al.
Published: (2023)
by: Crudele, Gabriel, et al.
Published: (2023)
Matchings in permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)
by: Inozemtsev, Eduard, et al.
Published: (2026)
Frankl's diversity theorem for permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)
by: Inozemtsev, Eduard, et al.
Published: (2026)
An almost complete $t$-intersection theorem for permutations
by: Kupavskii, Andrey
Published: (2024)
by: Kupavskii, Andrey
Published: (2024)
Efficient counting of permutation patterns via double posets
by: Diehl, Joscha, et al.
Published: (2024)
by: Diehl, Joscha, 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)
Record-biased permutations and their permuton limit
by: Bouvel, Mathilde, et al.
Published: (2024)
by: Bouvel, Mathilde, et al.
Published: (2024)
Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)
by: Ebrahimi, Javad B., et al.
Published: (2024)
On Alternating 6-Cycles in Edge-Coloured Graphs
by: Chen, Hao, et al.
Published: (2025)
by: Chen, Hao, et al.
Published: (2025)
Random sampling of permutations through quantum circuits
by: Adhikari, Bibhas
Published: (2024)
by: Adhikari, Bibhas
Published: (2024)
Twin-width and permutations
by: Bonnet, Édouard, et al.
Published: (2021)
by: Bonnet, Édouard, et al.
Published: (2021)
Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)
by: Wang, Shuche, et al.
Published: (2024)
Some permutation pentanomials over finite fields of even characteristic
by: Kousar, Farhana, et al.
Published: (2024)
by: Kousar, Farhana, et al.
Published: (2024)
Computing fixed point free automorphisms of graphs
by: Abiad, Aida, et al.
Published: (2026)
by: Abiad, Aida, et al.
Published: (2026)
A new proof of Delahan's induced-universality result
by: Chappelon, Jonathan
Published: (2026)
by: Chappelon, Jonathan
Published: (2026)
4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)
by: Ochem, Pascal, et al.
Published: (2025)
On a recolouring version of Hadwiger's conjecture
by: Bonamy, Marthe, et al.
Published: (2021)
by: Bonamy, Marthe, et al.
Published: (2021)
Non-detectable patterns hidden within sequences of bits
by: Allen, David, et al.
Published: (2024)
by: Allen, David, et al.
Published: (2024)
3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)
by: Gonçalves, Daniel
Published: (2025)
Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)
by: Silva, Caroline A. de Paula, et al.
Published: (2026)
Combinatorial Nullstellensatz Techniques
by: Freed, Daniel L.
Published: (2024)
by: Freed, Daniel L.
Published: (2024)
The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026)
by: Girão, António, et al.
Published: (2026)
($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
by: Angeliya, C. U., et al.
Published: (2025)
by: Angeliya, C. U., et al.
Published: (2025)
Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)
by: Sawada, Joe, et al.
Published: (2025)
Balanced-chromatic number and Hadwiger-like conjectures
by: Jiménez, Andrea, et al.
Published: (2023)
by: Jiménez, Andrea, et al.
Published: (2023)
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)
Resolvable Triple Arrays
by: Gordeev, Alexey, et al.
Published: (2025)
by: Gordeev, Alexey, et al.
Published: (2025)
The treewidth and pathwidth of graph unions
by: Alecu, Bogdan, et al.
Published: (2022)
by: Alecu, Bogdan, et al.
Published: (2022)
Size-4 Counterexamples to the Sidon-Extension Conjecture
by: Niu, Tong
Published: (2026)
by: Niu, Tong
Published: (2026)
Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)
by: Botler, Fábio, et al.
Published: (2023)
On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)
by: Eppstein, David, et al.
Published: (2025)
Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)
by: Gonçalves, Daniel, et al.
Published: (2023)
The Graph Coloring Game on $4\times n$-Grids
by: Brosse, Caroline, et al.
Published: (2024)
by: Brosse, Caroline, et al.
Published: (2024)
Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)
by: Gujgiczer, Anna, et al.
Published: (2023)
Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)
by: Gahlawat, Harmender
Published: (2025)
On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)
by: Havet, Frédéric, et al.
Published: (2023)