Saved in:
| Main Author: | Soukup, Jan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.06105 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Extending simple monotone drawings
by: Kynčl, Jan, et al.
Published: (2023)
by: Kynčl, Jan, et al.
Published: (2023)
Any fully graphic region of degree sequences can be sampled rapidly
by: Erdős, Péter L., et al.
Published: (2025)
by: Erdős, Péter L., et al.
Published: (2025)
An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers
by: Solé-Pi, Oriol
Published: (2024)
by: Solé-Pi, Oriol
Published: (2024)
Hamiltonian paths in iterated line graphs
by: Ekstein, Jan, et al.
Published: (2025)
by: Ekstein, Jan, et al.
Published: (2025)
Two sufficient conditions for graphs to admit path factors
by: Zhou, Sizhong, et al.
Published: (2023)
by: Zhou, Sizhong, et al.
Published: (2023)
Ordered Ramsey and Turán numbers of alternating paths and their variants
by: Kucheriya, Gaurav, et al.
Published: (2026)
by: Kucheriya, Gaurav, et al.
Published: (2026)
Book crossing numbers of the complete graph and small local convex crossing numbers
by: Ábrego, Bernardo M., et al.
Published: (2016)
by: Ábrego, Bernardo M., et al.
Published: (2016)
Planar point sets with forbidden $4$-point patterns and few distinct distances
by: Tao, Terence
Published: (2024)
by: Tao, Terence
Published: (2024)
Stacking and clearing in graph pebbling
by: Csernák, Tamás, et al.
Published: (2026)
by: Csernák, Tamás, et al.
Published: (2026)
$K_2$-Hamiltonian Graphs: II
by: Goedgebeur, Jan, et al.
Published: (2023)
by: Goedgebeur, Jan, et al.
Published: (2023)
Asymptotic structure. VI. Distant paths across a disc
by: Nguyen, Tung, et al.
Published: (2025)
by: Nguyen, Tung, et al.
Published: (2025)
The point-thicknesses of complete multipartite graphs
by: Liu, Wenzhong, et al.
Published: (2026)
by: Liu, Wenzhong, et al.
Published: (2026)
Note on the thickness of the Cartesian product of a complete graph and a path
by: Noguchi, Kenta
Published: (2026)
by: Noguchi, Kenta
Published: (2026)
On the crossing profile of rectilinear drawings of $K_n$
by: Chen, Isaac, et al.
Published: (2025)
by: Chen, Isaac, et al.
Published: (2025)
The rectilinear local crossing number of $K_n$
by: Ábrego, Bernardo M., et al.
Published: (2015)
by: Ábrego, Bernardo M., et al.
Published: (2015)
Hamiltonian paths extending a set of matchings in hypercubes
by: Ali, Abid, et al.
Published: (2025)
by: Ali, Abid, et al.
Published: (2025)
Constructing generalized Heffter arrays via near alternating sign matrices
by: Mella, Lorenzo, et al.
Published: (2023)
by: Mella, Lorenzo, et al.
Published: (2023)
On the threshold Ramsey multiplicity conjectures for paths and even cycles
by: Huang, Ting, et al.
Published: (2026)
by: Huang, Ting, et al.
Published: (2026)
The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
by: Ouyang, Zhangdong, et al.
Published: (2025)
by: Ouyang, Zhangdong, et al.
Published: (2025)
Rooted bicubic planar maps via Dyck paths
by: Gil, Juan B., et al.
Published: (2026)
by: Gil, Juan B., et al.
Published: (2026)
The Heawood approach to Tait colorings and defining vertex sets
by: Lerner, E. Yu.
Published: (2024)
by: Lerner, E. Yu.
Published: (2024)
Size Ramsey numbers of small graphs versus fans or paths
by: Li, Yufan, et al.
Published: (2024)
by: Li, Yufan, et al.
Published: (2024)
Towards a conjecture on degree conditions for Ramsey goodness of paths
by: You, Chunlin
Published: (2026)
by: You, Chunlin
Published: (2026)
A sufficient condition for cubic 3-connected plane bipartite graphs to be hamiltonian
by: Florek, Jan
Published: (2023)
by: Florek, Jan
Published: (2023)
Kempe equivalence of 4-colourings of some plane triangulations
by: Florek, Jan
Published: (2025)
by: Florek, Jan
Published: (2025)
Resonance graphs that are daisy cubes: from hypercubes to independent sets via resonant sets
by: Brezovnik, Simon, et al.
Published: (2024)
by: Brezovnik, Simon, et al.
Published: (2024)
Region crossing change on planar trivalent graphs
by: Cheng, Zhiyun
Published: (2022)
by: Cheng, Zhiyun
Published: (2022)
Monochromatic infinite sets in Minkowski planes
by: Frankl, Nóra, et al.
Published: (2023)
by: Frankl, Nóra, et al.
Published: (2023)
Partial Petrial polynomials for complete graphs and paths
by: Yan, Qi, et al.
Published: (2025)
by: Yan, Qi, et al.
Published: (2025)
A combinatorial study on product of filter large sets
by: Pal, Sujan, et al.
Published: (2023)
by: Pal, Sujan, et al.
Published: (2023)
Edge-colored 3-uniform hypergraphs without rainbow paths of length 3 and its applications to Ramsey theory
by: Li, Xihe, et al.
Published: (2025)
by: Li, Xihe, et al.
Published: (2025)
Clique factors in randomly perturbed graphs: the transition points
by: Antoniuk, Sylwia, et al.
Published: (2024)
by: Antoniuk, Sylwia, et al.
Published: (2024)
The tropical crossing number of a finite graph
by: Cape, Noah, et al.
Published: (2025)
by: Cape, Noah, et al.
Published: (2025)
Almost covers of finite sets of points
by: Hegedüs, Gábor
Published: (2024)
by: Hegedüs, Gábor
Published: (2024)
Revisiting Sparse Matrix Coloring and Bicoloring
by: Montoison, Alexis, et al.
Published: (2025)
by: Montoison, Alexis, et al.
Published: (2025)
Non-spherical sets versus lines in Euclidean Ramsey theory
by: Conlon, David, et al.
Published: (2024)
by: Conlon, David, et al.
Published: (2024)
Structure and generation of crossing-critical graphs
by: Dvořák, Zdeněk, et al.
Published: (2018)
by: Dvořák, Zdeněk, et al.
Published: (2018)
Thrackles on nonplanar surfaces
by: Hernández-Vélez, César, et al.
Published: (2025)
by: Hernández-Vélez, César, et al.
Published: (2025)
On increasing sequences formed by points from a random finite subset of a hypercube
by: Pittel, Boris
Published: (2025)
by: Pittel, Boris
Published: (2025)
Skewness, crossing number and Euler's bound for graphs on surfaces
by: Kainen, Paul C.
Published: (2025)
by: Kainen, Paul C.
Published: (2025)
Similar Items
-
Extending simple monotone drawings
by: Kynčl, Jan, et al.
Published: (2023) -
Any fully graphic region of degree sequences can be sampled rapidly
by: Erdős, Péter L., et al.
Published: (2025) -
An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers
by: Solé-Pi, Oriol
Published: (2024) -
Hamiltonian paths in iterated line graphs
by: Ekstein, Jan, et al.
Published: (2025) -
Two sufficient conditions for graphs to admit path factors
by: Zhou, Sizhong, et al.
Published: (2023)